| Determining the Optimal Solution Set for Linear Fractional Programming |
| |
| 作者姓名： | 薛声家 |
| |
| 作者单位： | Xue Shengjia Management College，Jinan University，Guangzhou 510632，P.R. China |
| |
| 摘 要： | 1 .ＩＮＴＲＯＤＵＣＴＩＯＮＬｉｎｅａｒｆｒａｃｔｉｏｎａｌｐｒｏｇｒａｍｍｉｎｇｒｅｆｅｒｓｔｏｎｏｎｌｉｎｅａｒｐｒｏｇｒａｍｍｉｎｇｐｒｏｂｌｅｍｓｏｆｏｐｔｉｍｉｚｉｎｇｔｈｅｒａｔｉｏｏｆｔｗｏｌｉｎｅａｒｆｕｎｃｔｉｏｎｓｉｎｔｈｅｐｒｅｓｅｎｃｅｏｆｌｉｎｅａｒｃｏｎｓｔｒａｉｎｔｓ .Ｉｎｇｅｎｅｒａｌ,ｔｈｅｏｐｔｉｍａｌｓｏｌｕｔｉｏｎｏｆｔｈｅｍａｔｈｅｍａｔｉｃａｌｐｒｏｇｒａｍ ｍｉｎｇｆｏｒｍｅｄｉｎａｃｔｕａｌｂｕｓｉｎｅｓｓｍａｎａｇｅｍｅｎｔｓｉｔｕａｔｉｏｎｓｐｒ…
|
Determining the Optimal Solution Set for Linear Fractional Programming |
| |
| Xue Shengjia Management College,Jinan University,Guangzhou ,P.R. China.Determining the Optimal Solution Set for Linear Fractional Programming[J].Journal of Systems Engineering and Electronics,2002,13(3). |
| |
| Authors: | Xue Shengjia Management College Jinan University Guangzhou PR China |
| |
| Institution: | Management College, Jinan University, Guangzhou 510632, P.R. China |
| |
| Abstract: | The structure of the optimal solution set is derived for linear fractional programming with the representation theorem of polyhedral sets. Based on an adaptation of the convex simplex method credited to Gilmore and Gomory, we give the uniqueness condition of optimal solution and the computational procedures to find all optimal solutions if the uniqueness condition is not satisfied. Finally, an illustrative example is also given. |
| |
| Keywords: | Linear fractional programming Optimal solution set Representation theorem Reduced gradient Convex simplex method |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
