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

From ApCoCoAWiki

(Updated example. (Skaspar)) |
|||

Line 24: | Line 24: | ||

ObjectiveF := x + z; | ObjectiveF := x + z; | ||

Latte.Minimize(Equations, LesserEq, GreaterEq, ObjectiveF); | Latte.Minimize(Equations, LesserEq, GreaterEq, ObjectiveF); | ||

+ | |||

+ | [[0], "No optimal solution found", [0]] | ||

+ | ------------------------------- | ||

</example> | </example> | ||

## Revision as of 10:43, 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):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); [[0], "No optimal solution found", [0]] -------------------------------