A modified version of Generalized Programming is presented for solving convex programming problems. The procedure uses convenient linear approximations of the gradient of the dual in order to ...
Transportation Science, Vol. 38, No. 3 (August 2004), pp. 343-356 (14 pages) Bounds and approximate formulae are developed for the average optimum distance of the transportation linear programming ...
一些您可能无法访问的结果已被隐去。
显示无法访问的结果
反馈