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

Sajal Chakroborty | Zendy; Md Babul Hasan | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Sajal Chakroborty,

Md Babul Hasan

Publication year - 2016

Publication title -

dhaka university journal of science

Language(s) - English

Resource type - Journals

eISSN - 2408-8528

pISSN - 1022-2502

DOI - 10.3329/dujs.v64i2.54487

Subject(s) - linear programming , computer science , mathematical optimization , algorithm , code (set theory) , fractional programming , linear fractional programming , c programming language , programming language , nonlinear programming , mathematics , software , nonlinear system , physics , set (abstract data type) , quantum mechanics

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)

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research