On the Computational Complexities of Finding Selected Refutations of Linear Programs.
K. SubramaniPiotr WojciechowskiPublished in: ISAIM (2024)
Keyphrases
- linear program
- linear programming
- optimal solution
- semi infinite
- simplex method
- integer programming formulations
- stochastic programming
- dynamic programming
- linear programming problems
- mathematical programming
- interior point methods
- primal dual
- column generation
- mixed integer linear program
- integer program
- objective function
- linear inequalities
- inventory routing
- mixed integer
- np hard
- cutting plane
- interior point
- extreme points
- multistage stochastic
- market equilibrium
- convex functions
- simulated annealing
- strongly polynomial
- low discrepancy sequences
- computational complexity
- machine learning