An algorithm for restricted normal form to solve dual type non-canonical linear fractional programming problem

An algorithm for restricted normal form to solve dual type non-canonical linear fractional programming problem

In this paper, an algorithm is presented to solve non-canonical linear fractional programming (LFP) problem, considering the restricted normal form. It provides a new way to solve all types of LFP problems. When the LFP problem is only in canonical form, Forhad et al. [13] derived an algorithm consi...

Full beskrivning

Bibliografiska uppgifter
Huvudupphovsmän: Hossain, Mozzem, Morshed, Monjur, Uddin, Mohammad Forhad
Materialtyp: Artikel
Språk:English
Publicerad: BRAC University 2010
Ämnen:
Linear fractional programming (LFP)
Canonical and noncanonical form
Transformation
Simplex method
Länkar:http://hdl.handle.net/10361/383

Liknande verk

Liknande verk