A modified simplex approach for solving bilevel linear programming problems

DOI10.1016/0377-2217(93)90327-JzbMath0806.90086OpenAlexW1999037958MaRDI QIDQ1261406

Hayri Önal

Publication date: 19 February 1995

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90327-j

zbMATH Keywords

simplex methodbilevel linear programmingKuhn-Tucker conditionsBeale's method

Mathematics Subject Classification ID

Quadratic programming (90C20) Linear programming (90C05) Hierarchical systems (93A13) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (17)

Designing an optimal contract mechanism in a cellulosic biofuel enterprise ⋮ Multilevel decision-making: a survey ⋮ A pivoting algorithm for linear programming with linear complementarity constraints ⋮ Bilevel and multilevel programming: A bibliography review ⋮ A multilevel analysis of agricultural credit distribution in East Java, Indonesia ⋮ A bilevel bottleneck programming problem ⋮ On bilevel fractional programming ⋮ Integer solutions via goal programming to hierarchical systems. ⋮ Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms ⋮ Computation of the optimal tolls on the traffic network ⋮ A study of local solutions in linear bilevel programming ⋮ A method for solving bilevel linear programming problems ⋮ The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem ⋮ The solution approach to linear fuzzy bilevel optimization problems ⋮ A note on a modified simplex approach for solving bilevel linear programming problems ⋮ KKT transformation approach for multi-objective multi-level linear programming problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Uses Software

• GAMS

Cites Work

• A linear bilevel programming algorithm based on bicriteria programming
• The hybrid algorithm for solving the three-level linear programming problem
• A computational analysis of LCP methods for bilinear and concave quadratic programming
• An investigation of the linear three level programming problem
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• A Representation and Economic Interpretation of a Two-Level Programming Problem
• Two-Level Linear Programming
• Two-Level Planning
• Mathematical Programs with Optimization Problems in the Constraints

This page was built for publication: A modified simplex approach for solving bilevel linear programming problems