A New Approach For Solving All Integer Linear Fractional Programming Problem


Abstract views: 77 / PDF downloads: 54

Authors

  • Geeta Modi Department of Mathematics, Government. M.V.M. Bhopal, India
  • Sushma Duraphe Department of Mathematics, Government. M.V.M. Bhopal, India
  • Huma Akhtar Research Scholar, Department of Mathematics, Government. M.V.M. Bhopal, India

Keywords:

Fractional programming, Simplex method, Dual simplex method, Gomorys fractional cut method

Abstract

In this paper we present a new approach for solving all integer linear fractional programming problem (ILFPP) in which the objective function is a linear fractional function, and where the constraint functions are in the form of linear inequalities. The approach adopted is based mainly upon simplex method as well as dual simplex method. A simple example is given to clarify the theory of this new approach.

 

Author Biographies

Geeta Modi, Department of Mathematics, Government. M.V.M. Bhopal, India

 

 

Sushma Duraphe, Department of Mathematics, Government. M.V.M. Bhopal, India

 

 

Huma Akhtar, Research Scholar, Department of Mathematics, Government. M.V.M. Bhopal, India

 

 

Downloads

Published

29-02-2016

How to Cite

Geeta Modi, Sushma Duraphe, & Huma Akhtar. (2016). A New Approach For Solving All Integer Linear Fractional Programming Problem. International Journal of Mathematics And Its Applications, 4(1 - C), 85–88. Retrieved from https://ijmaa.in/index.php/ijmaa/article/view/598

Issue

Vol. 4 No. 1 - C (2016)

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.