Second order duality in minmax fractional programming with generalized univexity
From MaRDI portal
Publication:656834
DOI10.1007/s10898-011-9694-1zbMath1258.90077OpenAlexW2060811786MaRDI QIDQ656834
Publication date: 13 January 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9694-1
Minimax problems in mathematical programming (90C47) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)
Related Items (3)
Second-order duality for a nondifferentiable minimax fractional programming under generalized \(\alpha\)-univexity ⋮ On second-order duality for nondifferentiable minimax fractional programming ⋮ On second-order duality for a class of nondifferentiable minimax fractional programming problem with \((C,\alpha,\rho,d)\)-convexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Second order duality for minmax fractional programming
- On nondifferentiable minimax fractional programming under generalized \(\alpha\)-type I invexity
- On sufficiency of the Kuhn-Tucker conditions
- Second order duality for a minimax programming problem
- Global optimization of fractional programs
- Second- and higher-order duality in nonlinear programming
- On minimax fractional optimality conditions with invexity
- On minimax fractional optimality conditions with \((F,\rho)\)-convexity
- Efficiency conditions and duality for a class of multiobjective fractional programming problems
- Optimality and duality for multiple-objective optimization under generalized type I univexity
- On minimax fractional optimality and duality with generalized convexity
- Minimax and applications
- On sufficiency and duality in multiobjective programming problem under generalized \(\alpha \)-type I univexity
- Duality for fractional minimax programming problems
- Optimality conditions and duality for a class of nonlinear fractional programming problems.
This page was built for publication: Second order duality in minmax fractional programming with generalized univexity