Showing 2019 · math.OCShow all
2 papers · 2 filters
math.OC2019
Theorems of the Alternative for Conic Integer Programming
Temitayo Ajayi, Varun Suriyanarayana, Andrew J. Schaefer
Farkas' Lemma is a foundational result in linear programming, with implications in duality, optimality conditions, and stochastic and bilevel programming. Its generalizations are k…
math.OC2019
Approximate Submodularity and Its Implications in Discrete Optimization
Temitayo Ajayi, Taewoo Lee, Andrew Schaefer
Submodularity is a key property in discrete optimization. Submodularity has been widely used for analyzing the greedy algorithm to give performance bounds and providing insight int…