
iii
Contents
R2015a
Improved performance and robustness of intlinprog
primal-simplex algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . 1-2
linprog dual-simplex algorithm returns more
information . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1-2
quadprog active-set algorithm will be removed . . . . . . . . 1-2
fmincon allows problems without constraints . . . . . . . . . . . . 1-2
Least-squares solvers allow equal upper and lower bounds . 1-3
quadprog allows zero or empty quadratic term . . . . . . . . . . . 1-3
Changes to algorithm field of output structure . . . . . . . . . . . 1-3
Mixed-integer quadratic programming example . . . . . . . . . . 1-3
R2014b
Dual-simplex algorithm in linprog linear programming
solver . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2-2
Interior-point algorithm in lsqlin linear least-squares
solver . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2-2
Commentaires sur ces manuels