A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent
From MaRDI portal
Publication:2195296
DOI10.1016/J.INS.2018.04.045zbMATH Open1440.90057OpenAlexW2799642017MaRDI QIDQ2195296FDOQ2195296
Authors: Yue Zheng, Zhen Zhang, Jie Lü, Guangquan Zhang 
Publication date: 8 September 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10453/129316
Recommendations
- A solution approach to the weak linear bilevel programming problems
- scientific article
- 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
- Title not available (Why is that?)
- Practical bilevel optimization. Algorithms and applications
- Mixed solutions for weak Stackelberg problems: existence and stability results.
- Foundations of bilevel programming
- Weak linear bilevel programming problems: existence of solutions via a penalty method
- Weak via strong Stackelberg problem: New results
- An overview of bilevel optimization
- Existence theorems of equilibrium points in stackelberg
- Title not available (Why is that?)
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Necessary optimality conditions in pessimistic bilevel programming
- Pessimistic bilevel optimization
- Global optimisation of pessimistic bi-level problems
- Topological existence and stability for Stackelberg problems
- New results on approximate solution in two-level optimization
- Title not available (Why is that?)
- A new reformulation-linearization technique for bilinear programming problems
- Jointly constrained bilinear programs and related problems: An overview
- A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network
- A cutting plane algorithm for solving bilinear programs
- On the computation of relaxed pessimistic solutions to MPECs
- Title not available (Why is that?)
- A symmetrical linear maxmin approach to disjoint bilinear programming
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- Particle swarm optimization for bi-level pricing problems in supply chains
- Concavity cuts for disjoint bilinear programming
- A linear max—min problem
- Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
- The bilinear programming problem
- Bilinear programming: An exact algorithm
- A new method for strong-weak linear bilevel programming problem
- Existence of solutions to weak nonlinear bilevel problemsviaMinSup and d.c. problems
- Weak nonlinear bilevel problems: existence of solutions via reverse convex and convex maximization problems
- Multi-level decision making. Models, methods and applications
- Multilevel decision-making: a survey
- A method for solving maximum-problems with a nonconcave quadratic objective function
- Some Properties of Redundant Constraints and Extraneous Variables in Direct and Dual Linear Programming Problems
- An exact penalty method for weak linear bilevel programming problem
- A solution approach to the weak linear bilevel programming problems
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)
