 |
|
What people are saying - Write a reviewWe haven't found any reviews in the usual places. Related books
Contents
Common terms and phrasesalgorithm arcs ij augmenting path auxiliary problem basic feasible solution basic solution basic variables bipartite graph Chapter coefficients column vector components computing constraints convex convex hull convex sets corresponding defined entering arc entering column entering the basis entering variable eta column example feasible tree solution finals of width finite Gaussian elimination Hence identity matrix integer leaving the basis leaving variable linear inequalities linear programming linear programming problem LP problems maximize cx subject maximum-flow problem mixed strategy network simplex method node nonbasic variables nonzero number of iterations objective function obtain optimal solution original problem path payoff matrix permutation permutation matrices pivot polyhedron problem maximize cx procedure proof Prove pure strategies replace resulting revised simplex method right-hand side satisfies slack variables solvable Solving the system Step subject to Ax system Ax systems of linear Theorem transshipment problem triangular factorization update upper bound zero Bibliographic information
|
