Presents a generalized dual simplex metjhod of directly solving a linear programming problem to which the basic solution is neither a feasible solution to the primal problem nor a feasible solution to the dual problem.
英
美
- 在已經(jīng)得到的線(xiàn)性規劃問(wèn)題的基本解既不是原始問(wèn)題的可行解 ,也不是對偶問(wèn)題的可行解的情形下 ,介紹求解線(xiàn)性規劃問(wèn)題的廣義對偶單純形法 ,它是對偶單純形法的推廣 ,用此法迭代一次就可得到一個(gè)對偶可行解
