APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING

DOI10.1142/S0217595904000199MaRDI QIDQ5315814zbMATH OpenFDO

Authors Narender Kumar, R. K. Budhraja, Aparna Mehra

Publication date 9 September 2005

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

Full work available at URL https://doi.org/10.1142/S0217595904000199

zbMATH Keywords

\(\varepsilon\)-efficiency\(\varepsilon\)-weak efficiency\(n\)-set functionsmultiobjective fractional programming

Mathematics Subject Classification ID

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

Recommendations

• Efficiency and duality in multiobjective fractional programming
• Efficient conditions of solution for fractional multiobjective programming
• Optimality of a class of generalized convex multi-objective fractional programming approximate weak efficient solutions
• The \(\epsilon\)-efficiency conditions for multiobjective fractional programming problems
• Efficiency conditions and duality for a class of multiobjective fractional programming problems
• An approximation to the nondominated set of a multiobjective linear fractional programming problem
• scientific article; zbMATH DE number 6160749
• Optimality and duality for multiobjective fractional programming involving \(n\)-set functions
• Semiinfinite multiobjective fractional programming. I: Sufficient efficiency conditions
• On multiobjective fractional programs

Cites work

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

Cited in

(5)

• An approximation to the nondominated set of a multiobjective linear fractional programming problem
• An approximation method for the efficiency set of multiobjective programming problems
• A sixth bibliography of fractional programming
• Parametric approach for approximate efficiency of robust multiobjective fractional programming problems
• On approximate efficiency in multiobjective programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315814)