ApCoCoA-1:Latte.Maximize: Difference between revisions
From ApCoCoAWiki
No edit summary |
No edit summary |
||
| Line 28: | Line 28: | ||
</description> | </description> | ||
<types> | <types> | ||
<type> | <type>apcocoaserver</type> | ||
</types> | </types> | ||
<see>GLPK.LPSolve</see> | <see>GLPK.LPSolve</see> | ||
Revision as of 15:59, 23 April 2009
Latte.Maximize
Maximizes the objective function over a polyhedral P given by a number of linear constraints
Syntax
Latte.Maximize(Equations: LIST, LesserEq: LIST, GreaterEq: LIST, ObjectiveF: POLY):INT
Description
Please note: The function(s) explained on this page is/are using the ApCoCoAServer. You will have to start the ApCoCoAServer in order to use it/them.
@param Equations: A list of linear polynomials, which are equivalent to the equality-part of the polyhedral constraints
@param LesserEq: A list of linear polynomials, which are equivalent to the lower or equal-part of the polyhedral constraints
@param GreaterEq: A list of linear polynomials, which are equivalent to the greater or equal-part of the polyhedral constraints
@param ObjectiveF: A linear Polynomial
@return The optimal value of the objective function
Example
Use S ::= QQ[x,y]; Equations := []; LesserEq := [x-1, x+y-1]; GreaterEq := [x,y]; ObjectiveF := x + z; Latte.Maximize(Equations, LesserEq, GreaterEq, ObjectiveF);
