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

תיאור מלא

מידע ביבליוגרפי
Main Authors: Hossain, Mozzem, Morshed, Monjur, Uddin, Mohammad Forhad
פורמט: Article
שפה:English
יצא לאור: BRAC University 2010
נושאים:
Linear fractional programming (LFP)
Canonical and noncanonical form
Transformation
Simplex method
גישה מקוונת:http://hdl.handle.net/10361/383

פריטים דומים

פריטים דומים