An extended Branch-and-Bound algorithm for fuzzy linear bilevel programming

被引：7

作者：

Zhang, Guangquan ^{[1
]}

Lu, Jie ^{[1
]}

Dillon, Tharam ^{[1
]}

机构：

[1] Univ Technol Sydney, Fac Informat Technol, POB 123, Broadway, NSW 2007, Australia

来源：

APPLIED ARTIFICIAL INTELLIGENCE | 2006年

基金：

澳大利亚研究理事会;

关键词：

bilevel programming; Branch-and-Bound algorithm; fuzzy sets; fuzzy optimization; decision making;

D O I：

10.1142/9789812774118_0043

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper presents an extended Branch-and-Bound algorithm for solving fuzzy linear bilevel programming problems. In a fuzzy bilevel programming model, the leader attempts to optimize his/her fuzzy objective with a consideration of overall satisfaction, and the follower tries to find an optimized strategy, under himself fuzzy objective, according to each of possible decisions made by the leader. This paper first proposes a new solution concept for fuzzy linear bilevel programming. It then presents a fuzzy number based extended Branch-and-bound algorithm for solving fuzzy linear bilevel programming problems.

引用

页码：291 / +

页数：2

共 50 条

[41] A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
Cheng, JL
Kise, H
Matsumoto, H
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 96 (03) : 578 - 590
[42] Solution Algorithm of the Fuzzy Fractional Bilevel Linear Programming Problem
Amiri, Neda
Hamidi, Farhad
Nehi, Hassan Mishmast
2015 4th Iranian Joint Congress on Fuzzy and Intelligent Systems (CFIS), 2015,
[43] Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
Lizhi Wang
Journal of Global Optimization, 2013, 55 : 491 - 506
[44] Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
Wang, Lizhi
JOURNAL OF GLOBAL OPTIMIZATION, 2013, 55 (03) : 491 - 506
[45] A BRANCH-AND-BOUND CLUSTERING-ALGORITHM
CHENG, CH
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1995, 25 (05): : 895 - 898
[46] MIXED-INTEGER LINEAR PROGRAMMING - VALIDITY CONDITIONS IN BRANCH-AND-BOUND METHODS
TERGNY, J
REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1971, 5 (NV1): : 11 - 21
[47] BRANCH-AND-BOUND STRATEGIES FOR DYNAMIC-PROGRAMMING
MORIN, TL
MARSTEN, RE
OPERATIONS RESEARCH, 1976, 24 (04) : 611 - 627
[48] Stochastic Constraint Programming with And-Or Branch-and-Bound
Babaki, Behrouz
Guns, Tias
de Raedt, Luc
PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 539 - 545
[49] IMPROVED BRANCH-AND-BOUND METHOD FOR INTEGER PROGRAMMING
TOMLIN, JA
OPERATIONS RESEARCH, 1971, 19 (04) : 1070 - &
[50] A RANDOMIZED PARALLEL BRANCH-AND-BOUND ALGORITHM
JANAKIRAM, VK
GEHRINGER, EF
AGRAWAL, DP
MEHROTRA, R
INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 1988, 17 (03) : 277 - 301

← 1 2 3 4 5 →