Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

Constrained Integer Multiobjective Linear Fractional Programming Problem

  • Published : 1996.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper an algorithm based on cutting plane approach is developed which constructs all the efficient p-tuples of multiobjective integer linear fractional programming problem. The integer solution is constrained to satisfy and h out of n additional constraint sets. A numerical illustration in support of the proposed algorithm is developed.

Keywords

References

  1. Naval Reseach Logistics Quarterly v.27 A note on Linear Fractional Programming Chandra,S.;Chandramohan,M.
  2. Zeitschrift fiie Angewandte Mathematik and Mechanik v.59 An improved Branch and Bound Method for Mixed Integer Linear Fractional Programs Chandra,S.;Chandramohan,M.
  3. Mathematical Programming v.8 Finding efficient points for linear multiple objective programs Ecker,J.G.;Koueda,I.A.
  4. Management Science v.27 no.9 Multiple Objective Linear Fractional Programming Kornbluth,J.S.H.;Steuer,R.E.
  5. European Journal of Operational Reseach v.19 A compromise procedure for the Multiple Objective Linear Fractional Programming Prablem Nykowski,I.;Zolkiewski,Z.
  6. Integer Programming Salkin,H.
  7. Journal of the Indian Institute of Scinece,Section B:Physical and Chemical Series v.62 Algorithms for Integer Fractional Programming Seshan,C.R.;Tibekar,V.G.
  8. Australian Journal of Statistics v.7 Some Aspects of Linear Fractional Functionals Programming Swarup,K.
  9. Optimization v.21 no.5 Constrained Integer Linear Fractional Programming Problem Verma,V.
  10. Methods and Models of Operations Research v.34 Ranking in Integer Linear Fractional Programming Problems Verma,V.;Bakshi,H.C.;Puri,M.C.