A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent
From MaRDI portal
Publication:2195296
Recommendations
- A solution approach to the weak linear bilevel programming problems
- scientific article; zbMATH DE number 6908183
- A branch and bound-based algorithm for the weak linear bilevel programming problems
- A new method for strong-weak linear bilevel programming problem
- Weak linear bilevel programming problems: existence of solutions via a penalty method
Cites work
- scientific article; zbMATH DE number 4128662 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- scientific article; zbMATH DE number 2246593 (Why is no real title available?)
- A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network
- A cutting plane algorithm for solving bilinear programs
- A linear max—min problem
- A method for solving maximum-problems with a nonconcave quadratic objective function
- A new method for strong-weak linear bilevel programming problem
- A new reformulation-linearization technique for bilinear programming problems
- A solution approach to the weak linear bilevel programming problems
- A symmetrical linear maxmin approach to disjoint bilinear programming
- Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
- An exact penalty method for weak linear bilevel programming problem
- An overview of bilevel optimization
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Bilinear programming: An exact algorithm
- Concavity cuts for disjoint bilinear programming
- Existence of solutions to weak nonlinear bilevel problemsviaMinSup and d.c. problems
- Existence theorems of equilibrium points in stackelberg
- Foundations of bilevel programming
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- Global optimisation of pessimistic bi-level problems
- Jointly constrained bilinear programs and related problems: An overview
- Mixed solutions for weak Stackelberg problems: existence and stability results.
- Multi-level decision making. Models, methods and applications
- Multilevel decision-making: a survey
- Necessary optimality conditions in pessimistic bilevel programming
- New results on approximate solution in two-level optimization
- On the computation of relaxed pessimistic solutions to MPECs
- Particle swarm optimization for bi-level pricing problems in supply chains
- Pessimistic bilevel optimization
- Practical bilevel optimization. Algorithms and applications
- Some Properties of Redundant Constraints and Extraneous Variables in Direct and Dual Linear Programming Problems
- The bilinear programming problem
- Topological existence and stability for Stackelberg problems
- Weak linear bilevel programming problems: existence of solutions via a penalty method
- Weak nonlinear bilevel problems: existence of solutions via reverse convex and convex maximization problems
- Weak via strong Stackelberg problem: New results
Cited in
(3)
This page was built for publication: A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2195296)
