A sequential LCP method for bilevel linear programming
From MaRDI portal
Publication:1184523
DOI10.1007/BF02098174zbMath0749.90049MaRDI QIDQ1184523
Ana M. Faustino, Joaquim Joao Júdice
Publication date: 28 June 1992
Published in: Annals of Operations Research (Search for Journal in Brave)
branch-and-boundBilevel Linear Programshybrid enumerative methodsequence of Linear Complementarity Problems
Hierarchical games (including Stackelberg games) (91A65) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Hierarchical systems (93A13) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (43)
Multilevel decision-making: a survey ⋮ Nonlinear integer bilevel programming ⋮ A pivoting algorithm for linear programming with linear complementarity constraints ⋮ Descent approaches for quadratic bilevel programming ⋮ Bilevel and multilevel programming: A bibliography review ⋮ Multiobjective two-level simple recourse programming problems with discrete random variables ⋮ The eigenvalue complementarity problem ⋮ A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints ⋮ Discrete linear bilevel programming problem ⋮ Links between linear bilevel and mixed 0-1 programming problems ⋮ A new descent method for symmetric non-monotone variational inequalities with application to eigenvalue complementarity problems ⋮ Computing the Pareto frontier of a bi-objective bi-level linear problem using a multiobjective mixed-integer programming algorithm ⋮ Algorithms for linear programming with linear complementarity constraints ⋮ Coordinating harvest planning and scheduling in an agricultural supply chain through a stochastic bilevel programming ⋮ Interactive fuzzy random two-level linear programming through fractile criterion optimization ⋮ Optimal cycle for a signalized intersection using global optimization and complementarity ⋮ Linear bilevel programming solution by genetic algorithm ⋮ Linear maps preserving Pareto eigenvalues ⋮ On finding global optima for the hinge fitting problem. ⋮ New branch-and-Cut algorithm for bilevel linear programming ⋮ Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms ⋮ An overview of bilevel optimization ⋮ A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience ⋮ Optimization problems with equilibrium constraints and their numerical solution. ⋮ Solving bilevel programming problems with multicriteria optimization techniques ⋮ A study of local solutions in linear bilevel programming ⋮ A method for solving bilevel linear programming problems ⋮ Solving linear programs with complementarity constraints using branch-and-cut ⋮ A Cutting Plane Approach for Solving Linear Bilevel Programming Problems ⋮ Solving bilevel linear programs using multiple objective linear programming ⋮ A hybrid tabu-ascent algorithm for the linear bilevel programming problem ⋮ The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem ⋮ On the quasiconcave bilevel programming problem ⋮ A bilevel programming approach to determining tax credits for biofuel production ⋮ A New Method To Solve Bi-Level Quadratic Linear Fractional Programming Problems ⋮ Upper and lower bounds for the optimal values of the interval bilevel linear programming problem ⋮ Fuzzy multiple level programming ⋮ Algorithms for Linear Bilevel Optimization ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ The nonlinear bilevel programming problem:formulations,regularity and optimality conditions ⋮ The nonlinear bilevel programming problem:formulations,regularity and optimality conditions ⋮ A quasiconcave minimization method for solving linear two-level programs ⋮ A simplex approach for finding local solutions of a linear bilevel program by equilibrium points
Cites Work
- Unnamed Item
- An experimental investigation of enumerative methods for the linear complementarity problem
- A penalty function approach for solving bi-level linear programs
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- Network design problem with congestion effects: A case of bilevel programming
- An implicit enumeration procedure for the general linear complementarity problem
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- New Finite Pivoting Rules for the Simplex Method
- Two-Level Linear Programming
This page was built for publication: A sequential LCP method for bilevel linear programming
