Solution of transportation problem is a kind of special problem in Linear programming , in actuality the supplies and demands can be changed. So it's not convenient to use the transportation algorithm. Over the decades years, many thoroughgoing and painstaking work had been done by some famous mathematicians for its effective algorithm.In this paper, we mainly solve two problems, the first one is that we discuss the influence on the optimum solution when one or more decision variables change, or multi-coefficients of more decision variables change at the same time and make out the optimum range. The second one is mainly studying sensitivity analysis and parametric linear programming about transportation problem with developed Hungry algorithm, also the thought, method, process, and example are given.
|