user

A primal-dual interior point algorithm for solving bilevel programming problem

被引：0
|
作者：
Weng, WT [1 ]
Wen, UP [1 ]
机构：
[1] Natl Tsing Hua Univ, Dept Ind Engn & Engn Management, Hsinchu, Taiwan
来源：
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH | 2000年 / 17卷 / 02期
关键词：
linear bilevel programming problem; rational reaction set; multiple objective linear programming problem; efficient set; primal-dual interior point algorithm;
D O I：
暂无
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
Linear bilevel programming problem is a decentralized decision problem with two hierarchical decision units. The rational reaction set of the linear bilevel programming problem is usually nonconvex, hence the problem is classified as a nonlinear optimization problem. This paper presents a modified primal-dual interior point algorithm for solving linear bilevel programming problem. A numerical example is used to illustrate the algorithm. Computational experiments are conducted to test the accuracy and efficiency of the proposed algorithm, and to demonstrate its performance.
引用
收藏
页码：213 / 231
页数：19
相关论文
共 50 条
  • [41] Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
    Katsuki Fujisawa
    Masakazu Kojima
    Kazuhide Nakata
    Mathematical Programming, 1997, 79 : 235 - 253
  • [42] Monotonicity of Primal-dual Interior-point Algorithms for Semidefinite Programming Problems
    Dept. of Math. and Info. Sciences, Tokyo Institute of Technology, 2-12-1 Oh-Okayama, Meguro-ku, Tokyo 152, Japan
    不详
    Optim Method Software, 2 (275-296):
  • [43] Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
    Cartis, Coralia
    APPLIED NUMERICAL MATHEMATICS, 2009, 59 (05) : 1110 - 1119
  • [44] ON THE SUPERLINEAR AND QUADRATIC CONVERGENCE OF PRIMAL-DUAL INTERIOR POINT LINEAR PROGRAMMING ALGORITHMS
    Zhang, Yin
    Tapia, Richard A.
    Dennis, John E., Jr.
    SIAM JOURNAL ON OPTIMIZATION, 1992, 2 (02) : 304 - 324
  • [45] Structured Primal-dual Interior-point Methods for Banded Semidefinite Programming
    Deng, Zhiming
    Gu, Ming
    Overton, Michael L.
    TOPICS IN OPERATOR THEORY: OPERATORS, MATRICES AND ANALYTIC FUNCTIONS, VOL 1, 2010, 202 : 111 - +
  • [46] On a wide region of centers and primal-dual interior point algorithms for linear programming
    Sturm, JF
    Zhang, SZ
    MATHEMATICS OF OPERATIONS RESEARCH, 1997, 22 (02) : 408 - 431
  • [47] Monotonicity of primal-dual interior-point algorithms for semidefinite programming problems
    Kojima, M
    Tunçel, L
    OPTIMIZATION METHODS & SOFTWARE, 1998, 10 (02): : 275 - 296
  • [48] A Primal-Dual Interior-Point Filter Method for Nonlinear Semidefinite Programming
    Liu, Zhong-Yi
    Sun, Wen-Yu
    OPERATIONS RESEARCH AND ITS APPLICATIONS, PROCEEDINGS, 2008, 8 : 112 - +
  • [49] A NEW EFFICIENT PRIMAL-DUAL PROJECTIVE INTERIOR POINT METHOD FOR SEMIDEFINITE PROGRAMMING
    Amina, Zerari
    Djamel, Benterki
    JOURNAL OF NONLINEAR FUNCTIONAL ANALYSIS, 2019, 2019
  • [50] COMPUTATIONAL EXPERIENCE WITH A PRIMAL-DUAL INTERIOR POINT METHOD FOR LINEAR-PROGRAMMING
    LUSTIG, IJ
    MARSTEN, RE
    SHANNO, DF
    LINEAR ALGEBRA AND ITS APPLICATIONS, 1991, 152 : 191 - 222
12345