An algorithm for the mixed-integer nonlinear bilevel programming problem
From MaRDI portal
Publication:1184528
DOI10.1007/BF02098177zbMath0751.90054MaRDI QIDQ1184528
Thomas A. Edmunds, Jonathan F. Bard
Publication date: 28 June 1992
Published in: Annals of Operations Research (Search for Journal in Brave)
Convex programming (90C25) Mixed integer programming (90C11) Nonlinear programming (90C30) Hierarchical games (including Stackelberg games) (91A65) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (27)
Multilevel decision-making: a survey ⋮ Bilevel and multilevel programming: A bibliography review ⋮ Solving a location problem of a Stackelberg firm competing with Cournot-Nash firms ⋮ A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings ⋮ An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions ⋮ A class of integer linear fractional bilevel programming problems ⋮ Solution for a class of closed-loop leader-follower games with convexity conditions on the payoffs ⋮ Discrete linear bilevel programming problem ⋮ Solving discrete linear bilevel optimization problems using the optimal value reformulation ⋮ A bilevel bottleneck programming problem ⋮ Solution techniques for bi-level knapsack problems ⋮ Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution ⋮ On bilevel fractional programming ⋮ A dynamic discrete network design problem for maintenance planning in traffic networks ⋮ Global solution of nonlinear mixed-integer bilevel programs ⋮ AN ITERATIVE ALGORITHM FOR A CLASS OF NONLINEAR INTEGER BILEVEL PROGRAMMING PROBLEMS WITH BOX CONSTRAINTS ⋮ A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs ⋮ A bi-level programming model and solution algorithm for the location of logistics distribution centers ⋮ Bilevel programming model and solution method for mixed transportation network design problem ⋮ A turning restriction design problem in urban road networks ⋮ Bilevel model for production-distribution planning solved by using ant colony optimization ⋮ Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints ⋮ Optimization problems for machine learning: a survey ⋮ An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems ⋮ Bilevel programming with discrete lower level problems ⋮ A New Method To Solve Bi-Level Quadratic Linear Fractional Programming Problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Experiments with successive quadratic programming algorithms
- An experimental investigation of enumerative methods for the linear complementarity problem
- Convex two-level optimization
- Closed-loop Stackelberg solution to a multistage linear-quadratic game
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- On two-level optimization
- Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The <scp>zoom</scp> System
- Closed-loop Stackelberg strategies with applications in the optimal control of multilevel systems
- The Mixed Integer Linear Bilevel Programming Problem
This page was built for publication: An algorithm for the mixed-integer nonlinear bilevel programming problem
