APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING

DOI10.1142/S0217595904000199zbMath1114.90136MaRDI QIDQ5315814

Aparna Mehra, Narender Kumar, R. K. Budhraja

Publication date: 9 September 2005

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

multiobjective fractional programming\(\varepsilon\)-efficiency\(n\)-set functions\(\varepsilon\)-weak efficiency

Mathematics Subject Classification ID

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

Related Items (1)

A sixth bibliography of fractional programming

Cites Work

• Optimization theory for n-set functions
• Optimal constrained selection of a measurable subset
• \(\epsilon\)-solutions in vector minimization problems
• Lagrange multiplier theorem of multiobjective programming problems with set functions
• On the optimality conditions of vector-valued \(n\)-set functions
• \(\epsilon\)-duality theorem of nondifferentiable nonconvex multiobjective programming
• Duality for multiobjective fractional programming involving \(n\)-set functions
• \(\varepsilon\)-optimality criteria for vector minimization problems via exact penalty functions
• \(\varepsilon\)-optimality and duality for multiobjective fractional programming
• \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
• ε-Optimal solutions in nondifferentiable convex programming and some related questions
• ε-approximate solutions in multiobjective optimization

This page was built for publication: APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING