A Computer Technique for Solving Linear Fractional Programming Problems by Using Dinkelbach’s Algorithm

Authors

  • Sajal Chakroborty Department of Electronics and Communications Engineering, East West University, Dhaka-1212, Bangladesh
  • Md Babul Hasan Department of Mathematics, Dhaka University, Dhaka-1000, Bangladesh

Keywords:

LFP, LP, AMPL, Objective function.

Abstract

In this paper, we introduce a computer oriented technique for solving linear fractional programming (LFP) problems by converting it into a single linear programming (LP) problem. We have used the idea of Dinkelbach’s algorithm. We use a mathematical programming language (AMPL) to develop computer code. A number of numerical examples are used to demonstrate the technique.

Dhaka Univ. J. Sci. 64(2): 121-125, 2016 (July)

Abstract
177
PDF
253

Downloads

Published

2016-07-31

How to Cite

A Computer Technique for Solving Linear Fractional Programming Problems by Using Dinkelbach’s Algorithm. (2016). Dhaka University Journal of Science, 64(2), 121-125. https://doi.org/10.3329/dujs.v64i2.54487

Issue

Vol. 64 No. 2 (2016)

Section

Articles

How to Cite

A Computer Technique for Solving Linear Fractional Programming Problems by Using Dinkelbach’s Algorithm. (2016). Dhaka University Journal of Science, 64(2), 121-125. https://doi.org/10.3329/dujs.v64i2.54487