Single-level reformulations of a specific non-smooth bilevel programming problem and their applications

DOI10.1007/S11590-019-01444-7MaRDI QIDQ2192986zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

bilevel programmingnewsvendor problemnon-convexone-shot decision theorynon-smoothassembly problem

Mathematics Subject Classification ID

Nonlinear programming (90C30)

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

• A smoothing method for mathematical programs with equilibrium constraints
• An overview of bilevel optimization
• Annotated Bibliography on Bilevel Programming and 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
• Approaches to multistage one-shot decision making
• Behavioral models for first-price sealed-bid auctions with the one-shot decision theory
• Bilevel and multilevel programming: A bibliography review
• Bilevel programming approaches to production planning for multiple products with short life cycles
• Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
• Focus theory of choice and its application to resolving the St. Petersburg, Allais, and Ellsberg paradoxes and other anomalies
• 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 complementarity constraints: stationarity, optimality, and sensi\-tivity.
• Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
• 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
• Sensitivity analysis for two-level value functions with applications to bilevel programming
• Solving bilevel programs with the KKT-approach
• Solving mathematical programs with equilibrium constraints
• The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
• Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints

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)