Mixed duality without a constraint qualification for minimax fractional programming
From MaRDI portal
Publication:4467183
DOI10.1080/02331930310001611574zbMath1098.90074MaRDI QIDQ4467183
Publication date: 9 June 2004
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930310001611574
90C46: Optimality conditions and duality in mathematical programming
90C32: Fractional programming
49N15: Duality theory (optimization)
49K35: Optimality conditions for minimax problems
Related Items
Mixed Duality without Constraint Qualification for Nonsmooth Fractional Programming, Duality and Lagrange multipliers for nonsmooth multiobjective programming, A sixth bibliography of fractional programming
Cites Work
- Unnamed Item
- An algorithm for generalized fractional programs
- Optimality conditions for fractional minmax programming
- Generalized fractional programming duality: A parametric approach
- On minimax fractional optimality conditions with \((F,\rho)\)-convexity
- Duality without a constraint qualification for minimax fractional programming
- Duality in generalized linear fractional programming
- Duality without constraint qualification for multiobjective programming
- Duality for Fractional Minimax Programming∗∗The research is partly supported by NSC, Taiwan.$ef:
- Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
- On mixed duality in mathematical programming.