Difference between revisions of "ApCoCoA-1:Latte.Minimize"
m (Bot: Category moved) |
|||
| Line 36: | Line 36: | ||
<key>Minimize</key> | <key>Minimize</key> | ||
<key>Latte.Minimize</key> | <key>Latte.Minimize</key> | ||
| − | <wiki-category>Package_latte</wiki-category> | + | <wiki-category>ApCoCoA-1:Package_latte</wiki-category> |
</command> | </command> | ||
Revision as of 16:16, 2 October 2020
Latte.Minimize
Minimizes the objective function over a polyhedral P given by a number of linear constraints.
Syntax
Latte.Minimize(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-2, x-y-24]; GreaterEq := [-x,-y]; ObjectiveF := x-2y; Latte.Minimize(Equations, LesserEq, GreaterEq, ObjectiveF); [[-2, 0], -2, [1, -2]] -------------------------------
