Optimization Toolbox™ provides functions for finding parameters that minimize or maximize objectives while satisfying constraints. The toolbox includes solvers for linear programming (LP), mixed-integer linear programming (MILP), quadratic programming (QP), nonlinear programming (NLP), constrained linear least squares, nonlinear least squares, and nonlinear equations. You can define your optimization problem with functions and matrices or by specifying variable expressions that reflect the underlying mathematics.
You can use the toolbox solvers to find optimal solutions to continuous and discrete problems, perform tradeoff analyses, and incorporate optimization methods into algorithms and applications. The toolbox lets you perform design optimization tasks, including parameter estimation, component selection, and parameter tuning. It can be used to find optimal solutions in applications such as portfolio optimization, resource allocation, and production planning and scheduling.
Learn the basics of Optimization Toolbox
Choose the appropriate approach: problem-based or solver-based.
Solve constrained or unconstrained nonlinear problems with one or more objectives, in serial or parallel
Solve linear programming problems with continuous and integer variables
Solve problems with quadratic objectives and linear constraints
Solve least-squares (curve-fitting) problems
Find roots of sets of nonlinear equations in serial or parallel
Understand solver outputs and improve results