Difference between revisions of "ApCoCoA-1:Latte.Maximize"
From ApCoCoAWiki
m (fixed links to namespace ApCoCoA) |
m (insert version info) |
||
| Line 1: | Line 1: | ||
| + | {{Version|1}} | ||
<command> | <command> | ||
<title>Latte.Maximize</title> | <title>Latte.Maximize</title> | ||
Latest revision as of 10:10, 7 October 2020
| This article is about a function from ApCoCoA-1. |
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]] -------------------------------
