Penalty function approach to linear trilevel programming
From MaRDI portal
Publication:1379973
DOI10.1023/A:1022610103712zbMath0898.90089OpenAlexW107247860MaRDI QIDQ1379973
Publication date: 5 March 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022610103712
Related Items (11)
Multilevel decision-making: a survey ⋮ A PENALTY METHOD FOR SOLVING BILEVEL LINEAR FRACTIONAL/LINEAR PROGRAMMING PROBLEMS ⋮ Adjustable robust optimization through multi-parametric programming ⋮ Multi-parametric global optimization approach for tri-level mixed-integer linear optimization problems ⋮ A relaxation solving approach for the linear trilevel programming problem ⋮ Model, solution concept, and \(K\)th-best algorithm for linear trilevel programming ⋮ A solution to bi/tri-level programming problems using particle swarm optimization ⋮ Tri-level mixed-binary linear programming: solution approaches and application in defending critical infrastructure ⋮ A modification of the trilevel \(K\)th-best algorithm ⋮ Necessary optimality condition for trilevel optimization problem ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- On the structure and properties of a linear multilevel programming problem
- The hybrid algorithm for solving the three-level linear programming problem
- A penalty function approach for solving bi-level linear programs
- Bilevel and multilevel programming: A bibliography review
- An investigation of the linear three level programming problem
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- A cutting plane algorithm for solving bilinear programs
- Unnamed Item
- Unnamed Item
This page was built for publication: Penalty function approach to linear trilevel programming