A set of procedures is described for solution of a general linear programming problem that seeks to maximize the linear functional W= n ∑ j=1 cjxj for coordinates xj≥0, subject to m restrictions of the form n ∑ j=1 aijxj ≤ bi and λ restrictions of the form n ∑ j=1 aijxj = bi.nAn LRLTRAN computer code, which performs the maximization, has been developed to follow these procedures and is also described. Illustration of the use of the simplex procedure is given.
展开▼
