求解线性规划问题的新方法及影子价格

The new method of seeing solution for linear programming problem and shadow price

对线性规划问题的求解提出了一种新方法，此方法不须引入人工变量而可在一种表格之下直接应用最小比值旋转迭代运算求得最优解．此方法我们称为最小比值旋转迭代法，应用此方法还可以避免单纯形法中的循环问题，同时也容易求出影子价格．

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.