SIMPLEX, a code for the solution of linear programming problems | Zendy

Henry M. Walker | Zendy; Laurence S. Hall | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

SIMPLEX, a code for the solution of linear programming problems

Author(s) -

Henry M. Walker,

Laurence S. Hall

Publication year - 1975

Language(s) - English

Resource type - Reports

DOI - 10.2172/4176650

Subject(s) - simplex , sigma , linear programming , combinatorics , simplex algorithm , code (set theory) , mathematics , set (abstract data type) , discrete mathematics , physics , algorithm , computer science , quantum mechanics , programming language

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research