What people are saying - Write a review
We haven't found any reviews in the usual places.
Review of Linear Programming
Using Linear Programming to Solve Integer Programs
Dual Fractional Integer Programming
22 other sections not shown
all-integer Appendix basic feasible solution basic variables bound algorithm branch and bound Chapter coefficients computations converge convex corresponding cosets cost dangling node defined discussed dual feasible dual simplex dynamic programming element enumeration equation Example extreme point feasible region Figure fractional free variables go to Step group minimization problem group problem Hence hyperplane inequality infeasible integer variable iteration knapsack problem Land and Doig lexicographically linear programming solution lower bound matrix maximize maximum minimum mixed integer program nonbasic variables nonnegative integer objective function obtain optimal integer solution optimal linear programming optimal solution pivot column pivot row plant location problem polyhedron primal procedure result Salkin satisfy Section set covering problem set partitioning problem simplex algorithm simplex method simplex tableau slack variables solve the integer Spielberg subproblem subtour Suppose Theorem traveling salesman problem upper bound vector yields zero zero-one