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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback