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 条
  • [21] Primal-dual interior point algorithm for penalized spectral unmixing
    Chouzenoux, Emilie
    Moussaoui, Said
    Legendre, Maxime
    Idier, Jerome
    TRAITEMENT DU SIGNAL, 2013, 30 (1-2) : 35 - 59
  • [22] A primal-dual interior point method for parametric semidefinite programming problems
    Wang Zhemin
    Zhou Kunping
    Huang Zhenghai
    Acta Mathematicae Applicatae Sinica, 2000, 16 (2) : 171 - 179
  • [23] A primal-dual regularized interior-point method for semidefinite programming
    Dehghani, A.
    Goffin, J. -L.
    Orban, D.
    OPTIMIZATION METHODS & SOFTWARE, 2017, 32 (01): : 193 - 219
  • [24] A feasible primal-dual interior point method for linear semidefinite programming
    Touil, Imene
    Benterki, Djamel
    Yassine, Adnan
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2017, 312 : 216 - 230
  • [25] SEMIDEFINITE PROGRAMMING: FORMULATIONS AND PRIMAL-DUAL INTERIOR-POINT METHODS
    Fukuda, Mituhiro
    Nakata, Maho
    Yamashita, Makoto
    REDUCED-DENSITY-MATRIX MECHANICS - WITH APPLICATION TO MANY-ELECTRON ATOMS AND MOLECULES, 2007, 134 : 103 - 118
  • [26] Superlinear convergence of primal-dual interior point algorithms for nonlinear programming
    Gould, NIM
    Orban, D
    Sartenaer, A
    Toint, PL
    SIAM JOURNAL ON OPTIMIZATION, 2001, 11 (04) : 974 - 1002
  • [27] A PRIMAL-DUAL INTERIOR POINT METHOD FOR PARAMETRIC SEMIDEFINITE PROGRAMMING PROBLEMS
    王哲民
    周昆平
    黄正海
    Acta Mathematicae Applicatae Sinica, 2000, (02) : 171 - 179
  • [28] On the convergence of an inexact primal-dual interior point method for linear programming
    Baryamureeba, V
    Steihaug, T
    LARGE-SCALE SCIENTIFIC COMPUTING, 2006, 3743 : 629 - 637
  • [29] A Primal-Dual Infeasible-Interior-Point Algorithm for Multiple Objective Linear Programming Problems
    HUANG Hui
    Wuhan University Journal of Natural Sciences, 2005, (02) : 351 - 354
  • [30] Dual versus primal-dual interior-point methods for linear and conic programming
    M. J. Todd
    Mathematical Programming, 2008, 111 : 301 - 313
12345