Solving a special class of multiple objective linear fractional programming problems

Authors

  • Said F. Tantawy Helwan University (11795), Cairo, Egypt

DOI:

https://doi.org/10.21914/anziamj.v56i0.6014

Keywords:

multiple objective, fractional programming, efficient solution, nondominated solution, conjugate gradient

Abstract

In this paper a feasible direction method is presented to find all efficient extreme points for a special class of multiple objective linear fractional programming problems, when all denominators are equal. This method is based on the conjugate gradient projection method, so that we start with a feasible point and then a sequence of feasible directions towards all efficient adjacent extremes of the problem can be generated. Since methods based on vertex information may encounter difficulties as the problem size increases, we expect that this method will be less sensitive to problem size. A simple production example is given to illustrate this method. doi:10.1017/S1446181114000200

Author Biography

Said F. Tantawy, Helwan University (11795), Cairo, Egypt

Mathematics Department, Faculty of Science, Helwan University (11795), Cairo, Egypt

Published

2014-11-02

Issue

Section

Articles for Printed Issues