DocumentCode :
2580439
Title :
On positioned solution of linear programming with grey parameters
Author :
Dang, Sifeng Liu Yaoguo ; Forrest, Jeffrey
Author_Institution :
Inst. for Grey Syst. Studies, Nanjing Univ. of Aeronaut. & Astronaut., Nanjing, China
fYear :
2009
fDate :
11-14 Oct. 2009
Firstpage :
751
Lastpage :
756
Abstract :
To surmount the difficulty in solving the problem of linear programming with grey parameters (LPGP), a series of new conceptions such as the positioned linear programming, the ideal model, the critical model, and some other new ideas are put forward. The problem of how the optimum solution is affected by the variation of positioned coefficients and the range of the variation of the optimum positioned values are studied. The satisfying solution for the positioned programming and the satisfying degree of the solution were defined. Thus, the LPGP problem will be converted into several problems of ordinary linear programming. The difficulty in solving the LPGP problem and how to appraise the solution have been surmounted to a certain degree.
Keywords :
grey systems; linear programming; grey parameters; linear programming; positioned coefficients; Appraisal; Cybernetics; Electronic mail; Linear programming; Operations research; Technical drawing; USA Councils; Vectors; positioned programming; satisfying solution; the LPGP;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Systems, Man and Cybernetics, 2009. SMC 2009. IEEE International Conference on
Conference_Location :
San Antonio, TX
ISSN :
1062-922X
Print_ISBN :
978-1-4244-2793-2
Electronic_ISBN :
1062-922X
Type :
conf
DOI :
10.1109/ICSMC.2009.5346825
Filename :
5346825
Link To Document :
بازگشت