Multiobjective duality for convex ratios

  • Wanka G
  • Boţ R
  • 3

    Readers

    Mendeley users who have this article in their library.
  • 4

    Citations

    Citations of this article.

Abstract

In this paper we present a duality approach for a multiobjective fractional programming problem. The components of the vector objective function are particular ratios involving the square of a convex function and a positive concave function. Applying the Fenchel-Rockafellar duality theory for a scalar optimization problem associated to the multiobjective primal, a dual problem is derived. This scalar dual problem is formulated in terms of conjugate functions and its structure gives an idea about how to construct a multiobjective dual problem in a natural way. Weak and strong duality assertions are presented. © 2002 Elsevier Science (USA). All rights reserved.

Author-supplied keywords

  • Conjugate duality
  • Fractional programming
  • Multiobjective duality
  • Pareto efficiency

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Gert Wanka

  • Radu Ioan Boţ

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free