Linear Optimization |
Contents
Preface | 1 |
Model Building with Linear Programming | 16 |
The Simplex Algorithm | 61 |
Copyright | |
35 other sections not shown
Other editions - View all
Common terms and phrases
a₁ activity artificial variables assignment assignment problem augmented matrix b₁ B₂ basic sequence basic variables c₁ called canonical form codomain coefficients components consider constraints corresponding cost matrix crude defined denote determine dual problem dual vector duality elements equivalence relation example feasible program feasible vector Figure finite free variables given hence illustrated indicate inequalities infeasible initial tableau input integers introduce linear equations linear programming problem loop mathematical maximize minimize mixed strategy negative nonbasic variables nonnegative nonzero notation number of units objective function obtain Oleum optimal feasible optimal program optimal solution original problem orthogonal output partition pivot operation player probability vector profit pure strategies real numbers saddle point scalar schema Section simplex algorithm simplex method slack variables Solve strategy subset Suppose symmetric Table tableau matrix theorem transportation problem U₁ vector space X₁ Y₁ zero