What people are saying - Write a review
We haven't found any reviews in the usual places.
The General LinearProgramming Problem
The Simplex Computational Procedure
10 other sections not shown
Other editions - View all
Aalk applications artificial vector assume basic feasible solution basis vectors Chap column vector computational procedure constraints convex combination convex function convex set corresponding cost coefficients defined determine developed discussion dual problem elements elimination equal to zero equations example Exercise extremal problem extreme point extreme-point solution formulation given Gomory Hence inequalities integer inverse iterations linear linear-programming problem linearly independent mathematical maximize Minimize minimum feasible solution minimum solution mixed strategies napkins node nonbasic variables nonnegative variables objective function obtain optimal optimum solution original problem parametric pivot positive production programming problem RAND Corporation reader row vector satisfy simplex algorithm simplex method simplex procedure simplex tableau slack variables Step subproblem subtracting techniques theorem transformation transportation problem X'CX yields