A cutting plane approach for solving linear bilevel programming problems
From MaRDI portal
Publication:2808063
DOI10.1007/978-3-319-17996-4_1zbMATH Open1350.90033OpenAlexW428209777MaRDI QIDQ2808063FDOQ2808063
Authors: Almas Jahanshahloo, Majid Zohrehbandian 
Publication date: 26 May 2016
Published in: Advanced Computational Methods for Knowledge Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-17996-4_1
Recommendations
Cites Work
- Solving bilevel linear programs using multiple objective linear programming
- Practical bilevel optimization. Algorithms and applications
- Foundations of bilevel programming
- New optimality conditions for the semivectorial bilevel optimization problem
- Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm
- An overview of bilevel optimization
- Optimality conditions for pessimistic semivectorial bilevel programming problems
- On calmness conditions in convex bilevel programming
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Variational analysis of marginal functions with applications to bilevel programming
- Direct search algorithm for bilevel programming problems
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Multiobjective bilevel optimization
- Solving bilevel programs with the KKT-approach
- Necessary conditions in multiobjective optimization with equilibrium constraints
- New necessary optimality conditions for bilevel programs by combining the MPEC and value function approaches
- Necessary optimality conditions for multiobjective bilevel programs
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- Optimality conditions for bilevel programming problems
- Mathematical Programs with Optimization Problems in the Constraints
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Multilevel optimization: algorithms and applications
- Optimality conditions for optimistic bilevel programming problem using convexifactors
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- On computational search for optimistic solutions in bilevel problems
- An extragradient algorithm for solving bilevel pseudomonotone variational inequalities
- A solution method for the linear static Stackelberg problem using penalty functions
- Bilevel optimization: on the structure of the feasible set
- Duality for semi-infinite programming problems involving \((H_p,r)\)-invex functions
- Bilevel time minimizing transportation problem
- On two-level optimization
- Title not available (Why is that?)
- Connections between single-level and bilevel multiobjective optimization
- Two-Level Linear Programming
- Bilevel programming: a survey
- A bi-level programming model and solution algorithm for the location of logistics distribution centers
- Optimality and duality results for bilevel programming problem using convexifactors
- A class of expected value bilevel programming problems with random coefficients based on rough approximation and its application to a production-inventory system
- A sequential LCP method for bilevel linear programming
- Hierarchical optimization: An introduction
- Bilevel decision via variational inequalities
- Necessary optimality conditions and a new approach to multiobjective bilevel optimization problems
- An objective penalty function of bilevel programming
- Bilevel problems over polyhedra with extreme point optimal solutions
- Existence and iterative algorithm of solutions for a class of bilevel generalized mixed equilibrium problems in Banach spaces
- Existence and algorithms for bilevel generalized mixed equilibrium problems in Banach spaces
- A low-carbon-based bilevel optimization model for public transit network
- The \(K\)th-best approach for linear bilevel multi-follower programming
- Existence of optimal solutions to mathematical programs with equilibrium constraints
- A penalty function method based on bilevel programming for solving inverse optimal value problems
- A penalty function method for solving inverse optimal value problem
- On intrinsic complexity of Nash equilibrium problems and bilevel optimization
- Saddle point problems, bilevel problems, and mathematical program with equilibrium constraint on complete metric spaces
- Nonlinear robust optimization via sequential convex bilevel programming
- A nonlinear multiobjective bilevel model for minimum cost network flow problem in a large-scale construction project
Cited In (8)
- A cutting plane method for bilevel linear programming with interval coefficients
- Exact method based on solution space cut for bi-objective Seru production
- Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
- On the use of intersection cuts for bilevel optimization
- A parallel cutting plane algorithm for two-level linear programming problems
- A cutting plane algorithm for solving linear bilevel programs
- Disjunctive cuts for continuous linear bilevel programming
This page was built for publication: A cutting plane approach for solving linear bilevel programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808063)
