The complementary unboundedness of dual feasible solution sets in convex programming.
Elmor L. PetersonPublished in: Math. Program. (1977)
Keyphrases
- feasible solution
- convex programming
- linear programming
- primal dual
- interior point methods
- linear program
- objective function
- optimal solution
- mixed integer
- tabu search
- lagrangian relaxation
- semidefinite programming
- mixed integer program
- convex optimization
- dynamic programming
- np hard
- quadratic programming
- convex functions
- convergence rate
- approximation algorithms
- machine learning
- convex hull
- mathematical model
- decision trees