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
simplex[minimize] - minimize a linear program
Calling Sequence
minimize(f, C)
minimize(f, C, vartype)
minimize(f, C, vartype, 'NewC', 'transform')
Parameters
f
-
linear expression
C
set or list of linear constraints
vartype
(optional) NONNEGATIVE or UNRESTRICTED
NewC
(optional) name
transform
Description
The expression f is the linear objective function to be minimized subject to the linear constraints C. The function minimize returns either a set of equations describing the optimal solution to the specified linear program, or the empty set in the case where no feasible solution to C exists, or NULL in the case where the solution is unbounded.
The equations returned by minimize can be substituted back into the objective function f to obtain the value of the objective function at the optimal solution.
A third parameter may be used to specify that all variables are constrained to be NONNEGATIVE; such constraints may also be listed explicitly. Similarly, UNRESTRICTED indicates that no sign constraint is to be placed on the variables.
A fourth and a fifth parameter may be included to specify names for returning the optimal description, and any variable transformations used to set up the problem.
The Optimization[LPSolve] command also computes solutions to linear programs. It is generally more efficient than the simplex[minimize] command, but performs all its computations using floating-point values.
The command with(simplex,minimize) allows the use of the abbreviated form of this command.
Examples
See Also
Optimization[LPSolve], simplex[maximize]
Download Help Document