A simple approach to optimality conditions in minmax programming
From MaRDI portal
Publication:5413892
Recommendations
- scientific article; zbMATH DE number 222438
- The optimality conditions for generalized minimax programming
- Optimality conditions for a class of nondifferentiable minmax programming problems
- scientific article; zbMATH DE number 4085436
- Necessary optimality conditions for minimax programming problems with mathematical constraints
Cites work
- Approximate optimality conditions for minimax programming problems
- Farkas' theorem of nonconvex type and its application to a min-max problem
- Necessary conditions and sufficient conditions for static minmax problems
- Necessary conditions in nonsmooth minimization via lower and upper subgradients
- New necessary optimality conditions in optimistic bilevel programming
- Sensitivity analysis for two-level value functions with applications to bilevel programming
- Subgradients of marginal functions in parametric mathematical programming
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- Variational Analysis
- Variational Stability and Marginal Functions via Generalized Differentiation
- Variational analysis of marginal functions with applications to bilevel programming
Cited in
(6)- Two-level value function approach to non-smooth optimistic and pessimistic bilevel programs
- scientific article; zbMATH DE number 502980 (Why is no real title available?)
- scientific article; zbMATH DE number 1923167 (Why is no real title available?)
- scientific article; zbMATH DE number 3849019 (Why is no real title available?)
- Comments on properties of the minmax solutions in goal programming
- Simple optimization problems via majorization ordering
This page was built for publication: A simple approach to optimality conditions in minmax programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5413892)