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

From ApCoCoAWiki
(Updated example.)
Line 1: Line 1:
 
<command>
 
<command>
 
<title>Latte.Minimize</title>
 
<title>Latte.Minimize</title>
<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):INT

Revision as of 14:07, 28 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):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,z];
Equations := [];
LesserEq := [x-1, x+y-1];
GreaterEq := [x,y];
ObjectiveF := x + z;
Latte.Minimize(Equations, LesserEq, GreaterEq, ObjectiveF);