Abstract
A set of procedures is described for solution of a general linear programming problem that seeks to maximize the linear functional W =/sup n/ $Sigma$/sub j = 1/ c/sub j/x/ sub j/ for coordinates x/sub j/ greater than or equal to 0, subject to m restrictions of the form/sup n/$Sigma$/sub j = 1/ a/sub ij/x/sub j/ less than or equal to b/sub i/ and l restrictions of the form/sup n/ $Sigma$/sub j = 1/ a/sub ij/x/sub j/ = b/sub i/. An 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. (auth)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have