A modified simplex approach for solving bilevel linear programming problems
The author studies the bilevel linear programming problem (P): \(\max z= c_ 1' x_ 2+ c_ 2' x_ 2\) s.t. \(x_ 1\geq 0\), \(x_ 2\in S(x_ 1)= \{\arg\max d'x| Dx_ 1+ Ax\leq b\), \(x\geq 0\}\). A solution method for (P) was proposed by \textit{J. F. Bard} [IEEE Trans. Syst. Man Cybern. SMC- 14, 711-717 (1984; Zbl 0552.90081)] on making use of Kuhn-Tucker conditions and associating the problem \((\text{P}')\): \(\max z= c_ 1' x_ 1+ c_ 2' x_ 2- M(y' w+ x_ 2' v)\) s.t. \(Dx_ 1+ Ax_ 2+ Jw= b\), \(A' y- Jv= d\), \(x_ 1\), \(x_ 2\), \(y\), \(w\), \(v\geq 0\), where \(M\) is a large penalty parameter. The difficulty of specifying \(M\) may result in a local solution rather than a global solution. Therefore the author presents here an algorithm that is a modification of the simplex method determining a local solution and at the same time gives the highest value to the objective function of the problem \((\text{P}')\). The algorithm suggested is based on Beale's method which greatly simplifies here due to the special structure of the problem \((\text{P}')\). The author claims that the algorithm performs well on small test problems but reports no experience about its efficiency vis a vis other available algorithms on large scale problems.
- A simplex approach for finding local solutions of a linear bilevel program by equilibrium points
- A simple algorithm for the-linear bilevel programming problem
- scientific article; zbMATH DE number 817607
- On penalty function method for a class of nonconvex constrained optimization problems.
- A DC algorithm for solving quadratic-linear bilevel optimization problems
- Integrating goal programming, Kuhn-Tucker conditions, and penalty function approaches to solve linear bi-level programming problems
- scientific article; zbMATH DE number 1376904
- A penalty function method for solving nonlinear-linear bilevel programming problem
- Bilevel linear programming
- Genetic algorithm for solving quadratic bilevel programming problem
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- A computational analysis of LCP methods for bilinear and concave quadratic programming
- A linear bilevel programming algorithm based on bicriteria programming
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- An investigation of the linear three level programming problem
- Mathematical Programs with Optimization Problems in the Constraints
- The hybrid algorithm for solving the three-level linear programming problem
- Two-Level Linear Programming
- Two-Level Planning
- Bilevel and multilevel programming: A bibliography review
- A multilevel analysis of agricultural credit distribution in East Java, Indonesia
- A bilevel bottleneck programming problem
- A note on a modified simplex approach for solving bilevel linear programming problems
- Multilevel decision-making: a survey
- A study of local solutions in linear bilevel programming
- KKT transformation approach for multi-objective multi-level linear programming problems
- Solving bi-level linear programmes
- Designing an optimal contract mechanism in a cellulosic biofuel enterprise
- Computation of the optimal tolls on the traffic network
- Integer solutions via goal programming to hierarchical systems.
- A pivoting algorithm for linear programming with linear complementarity constraints
- Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms
- A method for solving bilevel linear programming problems
- A simple algorithm for the-linear bilevel programming problem
- scientific article; zbMATH DE number 605178 (Why is no real title available?)
- On bilevel fractional programming
- scientific article; zbMATH DE number 910295 (Why is no real title available?)
- The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
- Bilevel optimization: theory, algorithms, applications and a bibliography
- The solution approach to linear fuzzy bilevel optimization problems
This page was built for publication: A modified simplex approach for solving bilevel linear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1261406)
