Abstract:In this paper, the author establishes a new method of seeing solution for linear programming problem, it can be obtained optimal solution by using directly minimum ratio twiddle iteration operation under a table and need not input artificial vabiable. This method is called "minimum ratio twiddle iteration algorithm"; using this method, we can avoid cycling of simples method and get the shadow price easily.
收稿日期: 2000-01-25
引用本文:
曹细玉 覃艳华. 求解线性规划问题的新方法及影子价格[J]. , 2000, 39(1): 0-0.
曹细玉 覃艳华. The new method of seeing solution for linear programming problem and shadow price. , 2000, 39(1): 0-0.