Specifications

For demos, application examples,
tutorials, user stories, and pricing:
Visit www.mathworks.com
Contact The MathWorks directly
US & Canada 508-647-7000
Benelux +31 (0)182 53 76 44
France +33 (0)1 41 14 67 14
Germany +49 (0)241 470 750
Italy +39 (011) 2274 700
Korea +82 (0)2 6006 5114
Spain +34 93 362 13 00
Sweden +46 (8)505 317 00
Switzerland +41 (0)31 950 60 20
UK +44 (0)1223 423 200
Visit www.mathworks.com to obtain
contact information for authorized
MathWorks representatives in countries
throughout Asia Pacific, Latin America,
the Middle East, Africa, and the rest
of Europe.
Quadratic and Linear Programming
Quadratic Programming
Quadratic programming problems involve
minimizing a multivariate quadratic func-
tion subject to linear equality and inequality
constraints. The toolbox implements three
methods for solving these problems: trust-
region, preconditioned conjugate gradient,
and active set.
Trust-region is used for bound constrained
problems.
Preconditioned conjugate gradient is used
for problems subject to equality constraints.
Active set minimizes the objective at each
iteration over the active set (a subset of the
constraints that are locally active) until it
reaches a solution.
Linear Programming
Linear programming problems consist of a
linear expression for the objective function
and linear equality and inequality constraints.
Two methods are used to solve this type of
problem: simplex and interior point.
The interior point method is based on a
primal-dual predictor-corrector algorithm,
and is used for large-scale linear problems.
The simplex method is a systematic proce-
dure for generating and testing candidate
vertex solutions to a linear program.
Binary Integer Programming
Binary integer programming problems
involve minimizing a linear objective func-
tion subject to linear equality and inequality
constraints. Each variable in the optimal
solution must be either a 0 or a 1.
The Optimization Toolbox solves these prob-
lems using a branch-and-bound algorithm that:
Searches for a feasible binary integer
solution
Updates the best binary point found as the
search tree grows
Verifies that no better solution is possible
by solving a series of linear programming
relaxation problems
Required Products
MATLAB
Related Products
Curve Fitting Toolbox. Perform model
fitting and analysis
Genetic Algorithm and Direct Search
Toolbox. Solve optimization problems using
genetic and direct search algorithms
Neural Network Toolbox. Design and
simulate neural networks
Spline Toolbox. Create and manipulate
spline approximation models of data
Statistics Toolbox. Apply statistical
algorithms and probability models
For more information on related products, visit
www.mathworks.com/products/optimization
Platform and System Requirements
For information on platform and system
requirements, visit www.mathworks.com/
products/optimization
Tel: 508.647.7000 info@mathworks.com www.mathworks.com
8513v04 06/04
© 2004 by The MathWorks, Inc. MATLAB, Simulink, Stateflow, Handle Graphics, and Real-Time Workshop are registered trademarks, and TargetBox is a trademark of The MathWorks, Inc. Other product or brand names are trademarks or registered trademarks of their respective holders.