Solving linear program as linear system in polynomial time.
Syamal K. SenSuja RamakrishnanRavi P. AgarwalPublished in: Math. Comput. Model. (2011)
Keyphrases
- linear program
- quadratic program
- simplex method
- linear programming
- linear programming problems
- linear inequalities
- integer program
- linear relaxation
- strongly polynomial
- quadratic programming
- semi infinite
- approximation algorithms
- mixed integer program
- primal dual
- approximate dynamic programming
- lp relaxation
- optimal solution
- mixed integer
- integrality gap
- interior point methods
- np hard
- column generation
- stochastic programming
- special case
- linear constraints
- multistage stochastic
- lagrange multipliers
- nonlinear programming
- dynamic programming
- objective function
- simplex algorithm
- linear systems
- computational complexity
- feasible solution
- semidefinite
- cutting plane
- algorithm for linear programming
- integer programming
- convex optimization problems
- linear programming relaxation
- mixed integer linear program
- semidefinite programming