A Proposed Technique for Solving Linear Fractional Bounded Variable Problems

Authors

  • H.K. Das Department of Mathematics,University of Dhaka, Dhaka-1000
  • M. Babul Hasan Department of Mathematics,University of Dhaka, Dhaka-1000

DOI:

https://doi.org/10.3329/dujs.v60i2.11522

Keywords:

Bounded Variable, Lower & Upper Bound, Linear Fractional, Pseudo Code, Computer Algebra

Abstract

In this paper, a new method is proposed for solving the problem in which the objective function is a linear fractional Bounded Variable (LFBV) function, where the constraints functions are in the form of linear inequalities and the variables are bounded. The proposed method mainly based upon the primal dual simplex algorithm. The Linear Programming Bounded Variables (LPBV) algorithm is extended to solve Linear Fractional Bounded Variables (LFBV).The advantages of LFBV algorithm are simplicity of implementation and less computational effort. We also compare our result with programming language MATHEMATICA.

DOI: http://dx.doi.org/10.3329/dujs.v60i2.11522

Dhaka Univ. J. Sci. 60(2): 223-230, 2012 (July)

 

Downloads

Download data is not yet available.
Abstract
128
PDF
350

Downloads

Published

2012-08-03

How to Cite

Das, H., & Hasan, M. B. (2012). A Proposed Technique for Solving Linear Fractional Bounded Variable Problems. Dhaka University Journal of Science, 60(2), 223–230. https://doi.org/10.3329/dujs.v60i2.11522

Issue

Vol. 60 No. 2 (2012)

Section

Articles