A global optimization approach for the linear two-level program
From MaRDI portal
Publication:1207038
DOI10.1007/BF01100237zbMath0771.90108MaRDI QIDQ1207038
Athanasios Migdalas, Peter Värbrand, Hoang Tuy
Publication date: 4 May 1993
Published in: Journal of Global Optimization (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Hierarchical games (including Stackelberg games) (91A65) Numerical methods based on necessary conditions (49M05) Multistage and repeated games (91A20)
Related Items
Linear programs with an additional rank two reverse convex constraint, Multilevel decision-making: a survey, Bilevel and multilevel programming: A bibliography review, Towards global bilevel dynamic optimization, Bilevel programming in traffic planning: Models, methods and challenge, A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games, An efficient chemical reaction algorithm for multi-objective combinatorial bi-level optimization, Global optimality test for maximin solution of bilevel linear programming with ambiguous lower-level objective function, A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem, Deriving the properties of linear bilevel programming via a penalty function approach, Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results, The complementary convex structure in global optimization, A novel approach to bilevel nonlinear programming, New branch-and-Cut algorithm for bilevel linear programming, Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms, Minimizing the sum of a convex function and a specially structured nonconvex function, An overview of bilevel optimization, A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints, A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience, Resolution method for mixed integer bi-level linear problems based on decomposition technique, A method for solving bilevel linear programming problems, Exact penalty functions for convex bilevel programming problems., Global solution of bilevel programs with a nonconvex inner program, Test problem construction for linear bilevel programming problems, Weak via strong Stackelberg problem: New results, On the quasiconcave bilevel programming problem, Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint, Algorithms for Linear Bilevel Optimization, BOLIB: Bilevel Optimization LIBrary of Test Problems, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, A quasiconcave minimization method for solving linear two-level programs
Cites Work
- Unnamed Item
- 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
- Linear programs with an additional reverse convex constraint
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
- Polyhedral annexation, dualization and dimension reduction technique in global optimization
- An Algorithm for Solving the General Bilevel Programming Problem
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- On two-level optimization
- New results on approximate solution in two-level optimization
- The Mixed Integer Linear Bilevel Programming Problem
- Convex Analysis
