Farkas' lemma for separable sublinear inequalities without qualifications.
Vaithilingam JeyakumarGuoyin LiPublished in: Optim. Lett. (2009)
Keyphrases
- johnson lindenstrauss
- sufficient conditions
- linear inequalities
- mixed integer linear programs
- mixed integer
- cutting plane algorithm
- databases
- decision trees
- facet defining inequalities
- linear programming
- space complexity
- valid inequalities
- cutting plane
- integer solution
- planar graphs
- upper level
- optimization problems
- high dimensional
- website