Difference between revisions of "ApCoCoA-1:Latte.Maximize"
From ApCoCoAWiki
m |
|||
| Line 3: | Line 3: | ||
<short_description>Maximizes the objective function over a polyhedral P given by a number of linear constraints.</short_description> | <short_description>Maximizes the objective function over a polyhedral P given by a number of linear constraints.</short_description> | ||
<syntax> | <syntax> | ||
| − | Latte.Maximize(Equations: LIST, LesserEq: LIST, GreaterEq: LIST, ObjectiveF: POLY): | + | Latte.Maximize(Equations: LIST, LesserEq: LIST, GreaterEq: LIST, ObjectiveF: POLY):LIST |
</syntax> | </syntax> | ||
Revision as of 15:31, 29 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):LIST
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 A list [[Optimal coordinates], Optimal solution, [Coeffs of objective function]]
Example
Use S ::= QQ[x,y]; Equations := []; LesserEq := [x-1, x+y-1]; GreaterEq := [x,y]; ObjectiveF := x + y; Latte.Maximize(Equations, LesserEq, GreaterEq, ObjectiveF); [[1, 0], 1, [1, 1]] -------------------------------
