Maple Professionel
Maple Académique
Maple Edition Étudiant
Maple Personal Edition
Maple Player
Maple Player for iPad
MapleSim Professionel
MapleSim Académique
Maple T.A. - Suite d'examens de classement
Maple T.A. MAA Placement Test Suite
Möbius - Didacticiels de mathématiques en ligne
Machine Design / Industrial Automation
Aéronautique
Ingénierie des véhicules
Robotics
Energie
System Simulation and Analysis
Model development for HIL
Modélisation du procédé pour la conception de systèmes de contrôle
Robotics/Motion Control/Mechatronics
Other Application Areas
Enseignement des mathématiques
Enseignement de l’ingénierie
Enseignement secondaire et supérieur (CPGE, BTS)
Tests et évaluations
Etudiants
Modélisation financière
Recherche opérationnelle
Calcul haute performance
Physique
Webinaires en direct
Webinaires enregistrés
Agenda des évènements
Forum MaplePrimes
Blog Maplesoft
Membres Maplesoft
Maple Ambassador Program
MapleCloud
Livres blancs techniques
Bulletin électronique
Livres Maple
Math Matters
Portail des applications
Galerie de modèles MapleSim
Cas d'Etudes Utilisateur
Exploring Engineering Fundamentals
Concepts d’enseignement avec Maple
Centre d’accueil utilisateur Maplesoft
Centre de ressources pour enseignants
Centre d’assistance aux étudiants
simplex[maximize] - maximize a linear program
Calling Sequence
maximize(f, C)
maximize(f, C, vartype)
maximize(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 maximized subject to the linear constraints C. The function maximize 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 maximize 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,maximize) allows the use of the abbreviated form of this command.
Examples
See Also
Optimization[LPSolve], simplex[minimize]
Download Help Document