论文信息 - A modified simplex approach for solving bilevel linear programming problems

A modified simplex approach for solving bilevel linear programming problems

Abstract A method for solving bilevel linear programming problems is proposed. The inner problem is represented by its Kuhn-Tucker conditions and the complementary slackness equations are moved to the outer objective as a penalty function. The global optimum of the resulting quadratic programme is reached by iterative application of a modified simplex algorithm.

Hayri Önal | Hayri Önal

[1] B. Eaves. On Quadratic Programming , 1971 .

[2] David Kendrick,et al. GAMS, a user's guide , 1988, SGNM.

[3] Jerome Bracken,et al. Mathematical Programs with Optimization Problems in the Constraints , 1973, Oper. Res..

[4] Gülseren Ünlü,et al. A Linear bilevel programming algorithm based on bicriteria programming , 1987, Comput. Oper. Res..

[5] Ue-Pyng Wen,et al. The hybrid algorithm for solving the three-level linear programming problem , 1986, Comput. Oper. Res..

[6] José Fortuny-Amat,et al. A Representation and Economic Interpretation of a Two-Level Programming Problem , 1981 .

[7] Jonathan F. Bard,et al. An explicit solution to the multi-level programming problem , 1982, Comput. Oper. Res..

[8] Wilfred Candler,et al. A linear two-level programming problem, , 1982, Comput. Oper. Res..

[9] J. Kornai,et al. Two-Level Planning , 1965 .

[10] Wayne F. Bialas,et al. Two-Level Linear Programming , 1984 .

[11] E. Beale. On quadratic proramming , 1959 .

[12] Joaquim Júdice,et al. A sequential LCP method for bilevel linear programming , 1992, Ann. Oper. Res..

[13] Jonathan F. Bard,et al. A Branch and Bound Algorithm for the Bilevel Programming Problem , 1990, SIAM J. Sci. Comput..

[14] Jonathan F. Bard,et al. An investigation of the linear three level programming problem , 1984, IEEE Transactions on Systems, Man, and Cybernetics.