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...
| Những tác giả chính: | , , |
|---|---|
| Định dạng: | Bài viết |
| Ngôn ngữ: | English |
| Được phát hành: |
BRAC University
2010
|
| Những chủ đề: | |
| Truy cập trực tuyến: | http://hdl.handle.net/10361/383 |