Single-level reformulations of a specific non-smooth bilevel programming problem and their applications
From MaRDI portal
Publication:2192986
DOI10.1007/S11590-019-01444-7zbMATH Open1448.90089OpenAlexW2951535526WikidataQ127654403 ScholiaQ127654403MaRDI QIDQ2192986FDOQ2192986
Authors: Peijun Guo, Xi-De Zhu 
Publication date: 24 August 2020
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-019-01444-7
Recommendations
- Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems
- Optimality conditions for bilevel programming problems
- A single-level reformulation of mixed integer bilevel programming problems
- A primal nonsmooth reformulation for bilevel optimization problems
- On solving simple bilevel programs with a nonconvex lower level program
Cites Work
- Bilevel and multilevel programming: A bibliography review
- An overview of bilevel optimization
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Sensitivity analysis for two-level value functions with applications to bilevel programming
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- A smoothing method for mathematical programs with equilibrium constraints
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Solving bilevel programs with the KKT-approach
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- KKT reformulation and necessary conditions for optimality in nonsmooth bilevel optimization
- Approaches to multistage one-shot decision making
- Newsvendor models for innovative products with one-shot decision theory
- On solving simple bilevel programs with a nonconvex lower level program
- On the numerical solution of a class of Stackelberg problems
- Solving mathematical programs with equilibrium constraints
- Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems
- Behavioral models for first-price sealed-bid auctions with the one-shot decision theory
- Focus theory of choice and its application to resolving the St. Petersburg, Allais, and Ellsberg paradoxes and other anomalies
- Bilevel programming approaches to production planning for multiple products with short life cycles
Cited In (5)
- A single-level reformulation of mixed integer bilevel programming problems
- A bilevel optimization model for the newsvendor problem with the focus theory of choice
- Algorithmic schemes for non-smooth simple bilevel programming problem and simple MPEC problem
- Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems
- A primal nonsmooth reformulation for bilevel optimization problems
This page was built for publication: Single-level reformulations of a specific non-smooth bilevel programming problem and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2192986)
