A linearization approach to multiobjective programming duality

DOI10.1006/JMAA.1993.1167MaRDI QIDQ2367782zbMATH OpenOpenAlexFDO

Authors C. R. Bector, Suresh Chandra, Chanchal Singh

Publication date 15 August 1993

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

Full work available at URL https://doi.org/10.1006/jmaa.1993.1167

zbMATH Keywords

duality of multiobjective problemslinear constraintspseudo-convex objective functions

Mathematics Subject Classification ID

Duality theory (optimization) (49N15) Multi-objective and goal programming (90C29) Fractional programming (90C32)

Review text

The authors consider duality of multiobjective problems having linear constraints and pseudo-convex objective functions. The dual is constructed by linearizing the various objective functions in the primal problem around an arbitrary but fixed point \(\bar x\) and formulating the dual of the multiobjective linear program so obtained. For deriving the results the authors show a closed relationship between the efficient solutions of the original problem and the efficient solutions of the linearized problem. Then by using Schönfeld's dual the results are obtained. Finally, an application of these results to multiobjective fractional programming problem with different denominators is discussed.

Recommendations

• scientific article; zbMATH DE number 4179145
• Duality for multi objective fractional programming via linearization and scalarization approaches.
• Multiobjective duality for convex-linear problems. II
• Duality for nonlinear multiobjective programs: A linearization approach

Cited in

(17)

• The theory of linear parametrization of criteria in multicriteria optimization
• Multiobjective duality for convex-linear problems. II
• Pareto optimality conditions and duality for vector quadratic fractional optimization problems
• Duality for nonlinear multiobjective programs: A linearization approach
• Necessary and sufficient conditions for achieving global optimal solutions in multiobjective quadratic fractional optimization problems
• Duality for multi objective fractional programming via linearization and scalarization approaches.
• Linearization approach to multi objective set covering problem with imprecise nonlinear fractional objectives
• scientific article; zbMATH DE number 4179145 (Why is no real title available?)
• scientific article; zbMATH DE number 4020843 (Why is no real title available?)
• A fifth bibliography of fractional programming^*
• Two types of duality in multiobjective fractional programming
• Linearization approach to multi-objective quadratic set covering problem
• Linear optimization with multiple equitable criteria
• scientific article; zbMATH DE number 2143160 (Why is no real title available?)
• scientific article; zbMATH DE number 7468708 (Why is no real title available?)
• On duality in multiple objective linear programming
• Saddle-point criteria in an -approximation method for nonlinear mathematical programming problems involving invex functions

This page was built for publication: A linearization approach to multiobjective programming duality

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