Linear Programming and Extensions: A Report Prepared for U.S. Air Force Project Rand

a₁ activity arcs array artificial variables assigned assume b₁ b₂ basic feasible solution basic set basic solution basic variables basis c₁ canonical form Chapter choose coefficients column computational constant terms convex function convex set corresponding cycle Dantzig determine dropped equations equivalent example finite number flow Fulkerson given Hence infeasible integer inverse linear combination linear inequality linear programming problem lower bound master program matrix matrix game minimize minimum mixed strategy nodes non-basic variables nondegenerate nonnegative obtained optimal solution optimum original system P₁ Phase pivot operations positive possible procedure PROOF pure strategies relative cost factors replaced restricted primal satisfying Show simplex algorithm simplex method simplex multipliers slack variables solving Step symmetric game Table tableau Theorem transportation problem transshipment Tucker upper bound vector x₁ x₂ y₁ zero