Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems
From MaRDI portal
Publication:1683936
DOI10.1007/s00186-017-0592-2zbMath1396.90097OpenAlexW2613212636WikidataQ57597765 ScholiaQ57597765MaRDI QIDQ1683936
Publication date: 1 December 2017
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-017-0592-2
Related Items (8)
A non-convex denoising model for impulse and Gaussian noise mixture removing using bi-level parameter identification ⋮ A bilevel optimization model for the newsvendor problem with the focus theory of choice ⋮ Focus programming: a bi‐level programming approach to static stochastic optimization problems ⋮ Bilevel programming approaches to production planning for multiple products with short life cycles ⋮ Single-level reformulations of a specific non-smooth bilevel programming problem and their applications ⋮ Focus theory of choice and its application to resolving the St. Petersburg, Allais, and Ellsberg paradoxes and other anomalies ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game
Cites Work
- Unnamed Item
- 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 augmented Lagrangian method for solving simple bilevel programs
- Bilevel programming: a survey
- A smoothing method for mathematical programs with equilibrium constraints
- Practical bilevel optimization. Algorithms and applications
- Bilevel and multilevel programming: A bibliography review
- On the entropic regularization method for solving min-max problems with applications
- Foundations of bilevel programming
- Possibilistic individual multi-period consumption-investment models
- Behavioral models for first-price sealed-bid auctions with the one-shot decision theory
- A modified relaxation scheme for mathematical programs with complementarity constraints
- Solving bilevel programs with the KKT-approach
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- Approaches to multistage one-shot decision making
- On solving simple bilevel programs with a nonconvex lower level program
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Improved convergence results for a modified Levenberg–Marquardt method for nonlinear equations and applications in MPCC
- New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
- On the numerical solution of a class of Stackelberg problems
- Variational Analysis
- Optimality conditions for bilevel programming problems
- 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
- Mathematical Programs with Equilibrium Constraints
This page was built for publication: Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems
