A least-squares primal-dual algorithm for solving linear programming problems.
Earl R. BarnesVictoria ChenBalaji GopalakrishnanEllis L. JohnsonPublished in: Oper. Res. Lett. (2002)
Keyphrases
- linear programming problems
- least squares
- linear programming
- linear program
- primal dual
- column generation
- mixed integer
- simplex method
- multiple objectives
- simplex algorithm
- interior point methods
- optimal solution
- parameter estimation
- optimization problems
- ls svm
- continuous variables
- convex optimization
- branch and bound
- search space