Single-level reformulations of a specific non-smooth bilevel programming problem and their applications
From MaRDI portal
Publication:2192986
DOI10.1007/s11590-019-01444-7zbMath1448.90089OpenAlexW2951535526WikidataQ127654403 ScholiaQ127654403MaRDI QIDQ2192986
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
Related Items (1)
Cites Work
- Newsvendor models for innovative products with one-shot decision theory
- Solving 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
- Bilevel and multilevel programming: A bibliography review
- Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems
- Focus theory of choice and its application to resolving the St. Petersburg, Allais, and Ellsberg paradoxes and other anomalies
- Behavioral models for first-price sealed-bid auctions with the one-shot decision theory
- 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
- Bilevel programming approaches to production planning for multiple products with short life cycles
- Approaches to multistage one-shot decision making
- On solving simple bilevel programs with a nonconvex lower level program
- An overview of bilevel optimization
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- On the numerical solution of a class of Stackelberg problems
- 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
- KKT Reformulation and Necessary Conditions for Optimality in Nonsmooth Bilevel Optimization
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
This page was built for publication: Single-level reformulations of a specific non-smooth bilevel programming problem and their applications
