Maple Professional
Maple Academic
Maple Student Edition
Maple Personal Edition
Maple Player
Maple Player for iPad
MapleSim Professional
MapleSim Academic
Maple T.A. - Testing & Assessment
Maple T.A. MAA Placement Test Suite
Möbius - Online Courseware
Machine Design / Industrial Automation
Aerospace
Vehicle Engineering
Robotics
Power Industries
System Simulation and Analysis
Model development for HIL
Plant Modeling for Control Design
Robotics/Motion Control/Mechatronics
Other Application Areas
Mathematics Education
Engineering Education
High Schools & Two-Year Colleges
Testing & Assessment
Students
Financial Modeling
Operations Research
High Performance Computing
Physics
Live Webinars
Recorded Webinars
Upcoming Events
MaplePrimes
Maplesoft Blog
Maplesoft Membership
Maple Ambassador Program
MapleCloud
Technical Whitepapers
E-Mail Newsletters
Maple Books
Math Matters
Application Center
MapleSim Model Gallery
User Case Studies
Exploring Engineering Fundamentals
Teaching Concepts with Maple
Maplesoft Welcome Center
Teacher Resource Center
Student Help Center
The Optimization Package Matrix Form
This worksheet introduces the matrix form of the optimization commands. For an introduction to the algebraic form and more explanation about each example, refer to the Optimization example worksheet.
In this worksheet, we will be minimizing a function (referred to as the objective function) subject to a number of constraints. Certain maximize examples are included as well. In any of the examples, the maximize option can be added to the command to find the maximum instead of the minimum.
Introduction to the Optimization Package form
The following command allows you to use the short form of the command names in the Optimization package.
The commands in the Optimization package allow you to specify the objective function and the constraints in several different ways. This worksheet deals with the matrix form of the objective function and constraints. The other forms are algebraic form and operator form.
Linear Programming Example 1
A linear program can be stated in the form:
subject to
where is in , is in , and is in
For a first example we have a simplex two dimensional linear programming problem of the form described above with:
The LPSolve command returns the optimal function values, as well as the point at which the optimal value occurs.
Alternatively, we could use the first two constraints and the nonnegative option.
The first element of the solution is the minimum value that the objective function obtains while satisfying the constraints. The second element indicates a point where the minimum is reached. This point is not necessarily unique.
Linear Programming Example 2
We can also include equality constraint as the next example shows, so our problem becomes:
where is in , is in , and is in , is in , and is in
This example demonstrates the maximize option.
Quadratic Programming Example
A quadratic program can be written in the form:
min 1/2*Transpose(x).H.x+Transpose(x).c
where H in is , c is in , A is in , and b is in , E is in , and f is in
The QPSolve command returns the optimal function values, as well as the point at which the optimal value occurs.
Nonlinear Programming
We can also use NLPSolve in matrix form where the gradient should be provided.
We can now use the matrix form of NLPSolve
Return to Index for Example Worksheets
Download Help Document
