On nondifferentiable fractional minimax programming
From MaRDI portal
Publication:1887880
DOI10.1016/S0377-2217(03)00437-5zbMath1134.90506OpenAlexW1976243398MaRDI QIDQ1887880
Publication date: 22 November 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00437-5
DualityNecessary optimality conditionsSufficient optimality conditionsNondifferentiable fractional minimax programmingStrict converse duality
Minimax problems in mathematical programming (90C47) Derivative-free methods and methods using generalized derivatives (90C56) Fractional programming (90C32)
Related Items
On solutions and duality of nonlinear nonsmooth fractional programs ⋮ On second-order duality for nondifferentiable minimax fractional programming ⋮ Second-order duality in nondifferentiable minmax programming involving type-I functions ⋮ Higher-order duality in nondifferentiable minimax programming with generalized type I functions ⋮ A sixth bibliography of fractional programming
Cites Work
- Necessary conditions and sufficient conditions for static minmax problems
- Necessary and sufficient conditions for minimax fractional programming
- Duality for fractional minimax programming problems
- Fractional Programming. I, Duality
- On a constraint qualification in a nondifferentiable programming problem
- A Class of Nondifferentiable Fractional Programming Problems
- An Extension of a Theorem on Supports of a Convex Function
- Unnamed Item
- Unnamed Item