A quasiconcave minimization method for solving linear two-level programs

DOI10.1007/BF01098360zbMath0792.90075OpenAlexW1999579552MaRDI QIDQ1318264

Athanasios Migdalas, Peter Värbrand, Hoang Tuy

Publication date: 27 March 1994

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01098360

zbMATH Keywords

global optimizationbranch-and-boundouter approximationStackelberg gameequivalent quasiconcave minimizationlinear two-level programmingreverse convex transformationsubdivision procedure

Mathematics Subject Classification ID

Nonlinear programming (90C30) Hierarchical games (including Stackelberg games) (91A65)

Related Items

Towards global bilevel dynamic optimization, Bilevel programming in traffic planning: Models, methods and challenge, Outer approximation algorithms for DC programs and beyond, A novel approach to bilevel nonlinear programming, Outer approximation algorithms for canonical DC problems, Global solution of bilevel programs with a nonconvex inner program, Test problem construction for linear bilevel programming problems, On the quasiconcave bilevel programming problem, Algorithms for Linear Bilevel Optimization, Bilevel Linear Optimization Under Uncertainty, BOLIB: Bilevel Optimization LIBrary of Test Problems, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• Unnamed Item
• Unnamed Item
• A linear bilevel programming algorithm based on bicriteria programming
• On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
• A note on a linear bilevel programming algorithm based on bicriteria programming
• Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
• Normal conical algorithm for concave minimization over polytopes
• Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
• The computational complexity of multi-level linear programs
• A sequential LCP method for bilevel linear programming
• A global optimization approach for the linear two-level program
• Bilevel linear programming
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• An Algorithm for Solving the General Bilevel Programming Problem
• Concave minimization under linear constraints with special structure
• A Representation and Economic Interpretation of a Two-Level Programming Problem
• New Branch-and-Bound Rules for Linear Bilevel Programming
• A linear max—min problem
• New results on approximate solution in two-level optimization
• Two-Level Linear Programming
• The Mixed Integer Linear Bilevel Programming Problem
• A solution method for the linear static Stackelberg problem using penalty functions