Linear Programing Solving
Linear Programing Solving version 1ES by M.R.C.M. Berkelaar. UNIX programmer's manual. The linear programming problem can be formulated as: Solve: A.x >= V1, with V2.x maximal. A is a matrix, x a vector of variables, V1 a vector called the right hand side, and V2 a vector specifying the objective function. This program solves problems of this kind.
