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...

Deskribapen osoa

Xehetasun bibliografikoak
Egile Nagusiak: Hossain, Mozzem, Morshed, Monjur, Uddin, Mohammad Forhad
Formatua: Artikulua
Hizkuntza:English
Argitaratua: BRAC University 2010
Gaiak:
Linear fractional programming (LFP)
Canonical and noncanonical form
Transformation
Simplex method
Sarrera elektronikoa:http://hdl.handle.net/10361/383

Internet

http://hdl.handle.net/10361/383

Antzeko izenburuak