Nondifferentiable minimax programming problems with applications
From MaRDI portal
Publication:2404334
DOI10.1007/s10479-015-1843-3zbMath1370.90289OpenAlexW2037598396MaRDI QIDQ2404334
Publication date: 18 September 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-015-1843-3
dualityoptimality conditionlimiting subdifferential\(L\)-invex-infine functionminimax programming problem
Minimax problems in mathematical programming (90C47) Multi-objective and goal programming (90C29) Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46) Optimality conditions (49K99)
Related Items
Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications, Optimality and duality in nonsmooth composite vector optimization and applications, Optimality and duality for \(E\)-minimax fractional programming: application to multiobjective optimization, Optimality conditions for nondifferentiable minimax programs and vector optimization problems, Unnamed Item, Directionally generalized differentiation for multifunctions and applications to set-valued programming problems, \(E\)-differentiable minimax programming under \(E\)-convexity, Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications, On Minimax Fractional Semi-Infinite Programming Problems with Applications, Minimax programming as a tool for studying robust multi-objective optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- \(L\)-invex-infine functions and applications
- Nondifferentiable minimax fractional programming in complex spaces with parametric duality
- Optimality conditions and duality in nonsmooth multiobjective optimization problems
- Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity
- Higher-order duality for nondifferentiable minimax programming problem with generalized convexity
- Convexificators and strong Kuhn-Tucker conditions
- Second order duality for nondifferentiable minimax programming problems with generalized convexity
- Second-order duality for nondifferentiable minimax programming involving generalized type I functions
- Generalized fractional minimax programming with \(B-(p,r)\)-invexity
- Optimality conditions for a nondifferentiable minimax programming in complex spaces
- Nondifferentiable mathematical programming and convex-concave functions
- On minimax fractional optimality conditions with invexity
- Duality for a class of minmax and inexact programming problem
- Infine functions, nonsmooth alternative theorems and vector optimization problems
- Parameter-free dual models for fractional programming with generalized invexity
- Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized \((\mathcal F,\rho,\theta)\) -convex functions
- Wolfe-type duality involving \((B,\eta)\)-index functions for a minimax programming problem
- Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity
- Non-differentiable minimax fractional programming with generalized \(\alpha\)-univexity
- Second-order duality in nondifferentiable minmax programming involving type-I functions
- Subdifferentials of Marginal Functions in Semi-infinite Programming
- Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
- A duality theorem for non-linear programming
- Duality for Fractional Minimax Programming∗∗The research is partly supported by NSC, Taiwan.$ef:
- The Lagrange Multiplier Theorem for Max-Min with Several Constraints
