A cutting plane method for bilevel linear programming with interval coefficients
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1264368
- A cutting plane approach for solving linear bilevel programming problems
- A cutting plane algorithm for solving linear bilevel programs
- Linear bilevel programming with interval coefficients
- On the use of intersection cuts for bilevel optimization
- Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm
- Intersection cuts for bilevel optimization
- A method for solving bilevel linear programming problems
- Branch and cut method for solving integer indefinite quadratic bilevel programs
- Enhanced intersection cutting-plane approach for linear complementarity problems
Cites work
- A penalty function approach for solving bi-level linear programs
- An overview of bilevel optimization
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Bilevel linear programming with fuzzy parameters
- Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm
- Computational Difficulties of Bilevel Linear Programming
- Disjunctive cuts for continuous linear bilevel programming
- Efficient solution of interval optimization problem
- Fault detection in discrete dynamic systems with uncertainty based on interval optimization
- Foundations of bilevel programming
- Fuzzy bilevel programming with multiple objectives and cooperative multiple followers
- Generalized linear fractional programming under interval uncertainty
- Grey linear programming, its solving approach, and its application
- scientific article; zbMATH DE number 1264368 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 3215121 (Why is no real title available?)
- scientific article; zbMATH DE number 3325265 (Why is no real title available?)
- Linear bilevel programming with interval coefficients
- Linear programming with interval coefficients
- Optimal value bounds in nonlinear programming with interval data
- Optimal value range in interval linear programming
- Practical bilevel optimization. Algorithms and applications
- Solving bi-level programming problems on using global criterion method with an interval approach
- The optimal solution set of the interval linear programming problems
- Weak and strong solvability of interval linear systems of equations and inequalities
Cited in
(13)- Multilevel decision-making: a survey
- A novel approach based on preference-based index for interval bilevel linear programming problem
- Global optimality test for maximin solution of bilevel linear programming with ambiguous lower-level objective function
- Bilevel linear programming with ambiguous objective function of the follower
- On the use of intersection cuts for bilevel optimization
- An approach based on reliability-based possibility degree of interval for solving general interval bilevel linear programming problem
- Upper and lower bounds for the optimal values of the interval bilevel linear programming problem
- The quadratic-linear bi-level programming with interval coefficients
- Solution of a bi-level programming problem with inexact parameters
- scientific article; zbMATH DE number 1264368 (Why is no real title available?)
- Linear bilevel programming with interval coefficients
- Solving interval bilevel linear programming problem based on credibility method
- Bilevel optimization: theory, algorithms, applications and a bibliography
This page was built for publication: A cutting plane method for bilevel linear programming with interval coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2259044)
