Global optimality test for maximin solution of bilevel linear programming with ambiguous lower-level objective function
From MaRDI portal
(Redirected from Publication:1699146)
Recommendations
Cites work
- A cutting plane method for bilevel linear programming with interval coefficients
- A global optimization approach for the linear two-level program
- A note on a method for generating points uniformly on n -dimensional spheres
- An overview of bilevel optimization
- Bilevel programming and price setting problems
- Bilevel programming in traffic planning: Models, methods and challenge
- Computational Difficulties of Bilevel Linear Programming
- Construction of a real-world bilevel linear programming model of the highway network design problem
- Convex analysis and global optimization
- Convex programs with an additional reverse convex constraint
- Foundations of bilevel programming
- Global optimality test for maximin solution of bilevel linear programming with ambiguous lower-level objective function
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- Linear bilevel programming with interval coefficients
- New Branch-and-Bound Rules for Linear Bilevel Programming
- On two-level optimization
- Practical bilevel optimization. Algorithms and applications
- Reverse convex programming
- Stackelberg solutions to multiobjective two-level linear programming problems
- The bilinear programming problem
- The polynomial hierarchy and a simple model for competitive analysis
Cited in
(9)- 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
- Test problem construction for linear bilevel programming problems
- The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective
- Optimal storage and transmission investments in a bilevel electricity market model
- A survey of decision making and optimization under uncertainty
- Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints
- Uncertainty handling in bilevel optimization for robust and reliable solutions
- Bilevel optimization: theory, algorithms, applications and a bibliography
This page was built for publication: Global optimality test for maximin solution of bilevel linear programming with ambiguous lower-level objective function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1699146)