Constraint Optimal Selection Techniques (COSTs) for nonnegative linear programming problems.
Goh SaitoHerbert W. CorleyJay M. RosenbergerTai-Kuan SungAlireza NoroziroshanPublished in: Appl. Math. Comput. (2015)
Keyphrases
- linear programming problems
- optimal selection
- linear programming
- linear program
- primal dual
- column generation
- optimal solution
- simplex method
- multiple objectives
- mixed integer
- interior point methods
- integer programming
- feasible solution
- average cost
- objective function
- np hard
- convex optimization
- semidefinite programming
- dynamic programming
- optimization problems
- upper bound