On positioned solution of linear programming with grey parameters

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.