Duality for a class of nondifferentiable mathematical programming problems
From MaRDI portal
Publication:1149383
DOI10.1016/0022-247X(81)90025-1zbMath0453.90077MaRDI QIDQ1149383
Publication date: 1981
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
dualityminimax problemnondifferentiable mathematical programmingnondifferentiable objective functions
Related Items (26)
Duality for a class of nondifferentiable mathematical programming problems in complex space ⋮ Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity ⋮ Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity ⋮ Second order duality for nondifferentiable minimax programming problems with generalized convexity ⋮ Second-order duality for nondifferentiable minimax programming involving generalized type I functions ⋮ Set-valued minimax programming problems under generalized cone convexity ⋮ Optimality and duality for nondifferentiable minimax fractional programming with generalized convexity ⋮ SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS ⋮ Duality for Fractional Minimax Programming∗∗The research is partly supported by NSC, Taiwan.$ef: ⋮ Complex minimax fractional programming of analytic functions ⋮ Nonsmooth semi-infinite minmax programming involving generalized \((\varPhi,\rho)\)-invexity ⋮ Generalized pseudo-convex minmax programming. ⋮ Duality on a nondifferentiable minimax fractional programming ⋮ Second-order duality in nondifferentiable minmax programming involving type-I functions ⋮ Duality in nondifferentiable minimax fractional programming with generalized convexity ⋮ Computational aspects of general minimax optimization ⋮ Generalized fractional minimax programming with \(B-(p,r)\)-invexity ⋮ Higher order type-I α-invexity and duality in nondifferentiable mathematical programming ⋮ On minimax fractional optimality conditions with invexity ⋮ On minimax fractional optimality conditions with \((F,\rho)\)-convexity ⋮ Higher-order duality in nondifferentiable minimax programming with generalized type I functions ⋮ Necessary and sufficient conditions for minimax fractional programming ⋮ Optimality and duality for minmax problems involving arcwise connected and generalized arcwise connected functions ⋮ On semi-infinite minmax programming with generalized invexity ⋮ Optimality conditions and duality for a minimax fractional programming with generalized convexity ⋮ Continuous-time fractional minmax programming
Cites Work
- Unnamed Item
- Unnamed Item
- Necessary conditions and sufficient conditions for static minmax problems
- A subgradient duality theorem
- A class of nondifferentiable mathematical programming problems
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- A duality theorem for non-linear programming
- The Theory of Max-Min, with Applications
- A Note on Duality Theorem for a Nonlinear Programming Problem
- Dual Programs [Letter to the Editor]
This page was built for publication: Duality for a class of nondifferentiable mathematical programming problems