Multiobjective duality for convex ratios.

DOI10.1016/S0022-247X(02)00361-XzbMath1072.90035OpenAlexW2039913946MaRDI QIDQ1856918

Gert Wanka, Radu Ioan Boţ

Publication date: 11 February 2003

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-247x(02)00361-x

zbMATH Keywords

Pareto efficiencyFractional programmingConjugate dualityMultiobjective duality

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Fractional programming (90C32)

Related Items (4)

Fenchel-Lagrange duality versus geometric duality in convex optimization ⋮ Multiobjective duality for convex semidefinite programming problems ⋮ Duality for optimization problems with entropy-like objective functions ⋮ A sixth bibliography of fractional programming

Cites Work

• Theory of multiobjective optimization
• Multiobjective duality for convex-linear problems. II
• Multicriteria fractional programming -- an approach by means of conjugate functions
• New constraint qualification and conjugate duality for composed convex optimization problems
• Vector-valued lagrangian and multiobjective fractional programming duality
• Duality in Fractional Programming: A Unified Approach
• Duality for a sum of convex ratios
• Programming Problems with Convex Fractional Functions
• Duality in nonlinear fractional programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Multiobjective duality for convex ratios.