Difference between revisions of "ApCoCoA-1:Latte.Minimize"

From ApCoCoAWiki
m
Line 3: Line 3:
 
<short_description>Minimizes the objective function over a polyhedral P given by a number of linear constraints.</short_description>
 
<short_description>Minimizes the objective function over a polyhedral P given by a number of linear constraints.</short_description>
 
<syntax>
 
<syntax>
Latte.Minimize(Equations: LIST, LesserEq: LIST, GreaterEq: LIST, ObjectiveF: POLY):INT
+
Latte.Minimize(Equations: LIST, LesserEq: LIST, GreaterEq: LIST, ObjectiveF: POLY):LIST
 
</syntax>
 
</syntax>
  
Line 14: Line 14:
 
<item>@param <em>GreaterEq</em>: A list of linear polynomials, which are equivalent to the greater or equal-part of the polyhedral constraints</item>
 
<item>@param <em>GreaterEq</em>: A list of linear polynomials, which are equivalent to the greater or equal-part of the polyhedral constraints</item>
 
<item>@param <em>ObjectiveF</em>: A linear Polynomial</item>
 
<item>@param <em>ObjectiveF</em>: A linear Polynomial</item>
<item>@return The optimal value of the objective function</item>
+
<item>@return A list: [[Optimal coordinates], Optimal solution, [Coeffs of objective function]] </item>
 
</itemize>
 
</itemize>
  

Revision as of 15:32, 29 April 2009

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]]
-------------------------------