Solving LP-MPC problems using ramp functions*
Résumé
A new implementation of the Simplex method for solving linear programming problems is developed, and its application for solving MPC problems with linear objective functions is described. A detailed comparison with existing implementations of the Simplex method is beyond the scope of this paper. However, initial numerical results indicate that gains in calculation times may be achieved for problems of small to moderate size.
Domaines
Automatique / Robotique| Origine | Fichiers produits par l'(les) auteur(s) |
|---|