An implementation of the simplex method for linear programming problems with variable upper bounds.
Michael J. ToddPublished in: Math. Program. (1982)
Keyphrases
- linear programming problems
- simplex method
- upper bound
- linear programming
- linear program
- primal dual
- simplex algorithm
- linear fractional
- column generation
- convergence rate
- lower bound
- interior point methods
- optimal solution
- multiple objectives
- branch and bound
- convex optimization
- feasible solution
- search algorithm
- constraint satisfaction problems
- scheduling problem
- dynamic programming
- np hard
- support vector