A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column.
Daniel DadushZhuan Khye KohBento NaturaNeil OlverLászló A. VéghPublished in: STOC (2024)
Keyphrases
- linear program
- rows and columns
- binary matrices
- linear programming
- binary matrix
- data matrix
- simplex method
- semi infinite
- optimal solution
- multistage stochastic
- column generation
- dynamic programming
- objective function
- stochastic programming
- primal dual
- linear programming problems
- integer program
- interior point methods
- extreme points
- mixed integer
- decision variables
- missing values
- np hard
- linear inequalities
- nelder mead
- feasible solution
- singular value decomposition
- mixed integer linear program