Difference between revisions of "ApCoCoA-1:GLPK.LPMax"
m (Bot: Category moved) |
Andraschko (talk | contribs) m (added version info) |
||
| (3 intermediate revisions by one other user not shown) | |||
| Line 1: | Line 1: | ||
| + | {{Version|1|[[Package glpk/GLPK.LPMax]]}} | ||
<command> | <command> | ||
<title>GLPK.LPMax</title> | <title>GLPK.LPMax</title> | ||
| Line 12: | Line 13: | ||
<item>@param <em>Inequations</em>: List of linear polynomials, which are equivalent to the conditions of the linear program of the form A <= 0.</item> | <item>@param <em>Inequations</em>: List of linear polynomials, which are equivalent to the conditions of the linear program of the form A <= 0.</item> | ||
<item>@param <em>Bounds</em>: List of lists with two elements. Each List contains the lower and upper bounds for each variable. You can choose between INT or RAT for the type of each bound, if you type in a (empty) string, then it means minus infinity (first place) or plus infinity (second place).</item> | <item>@param <em>Bounds</em>: List of lists with two elements. Each List contains the lower and upper bounds for each variable. You can choose between INT or RAT for the type of each bound, if you type in a (empty) string, then it means minus infinity (first place) or plus infinity (second place).</item> | ||
| − | <item>@param <em>Method</em>: You can choose between the interior-point-method ( | + | <item>@param <em>Method</em>: You can choose between the interior-point-method ("InterP") or the simplex-algorithm ("Simplex"). Usually you should use the simplex-algorithm.</item> |
<item>@return List of linear polynomials, the zeros of the polynomials are the points where the optimal value of the objective function is achieved</item> | <item>@return List of linear polynomials, the zeros of the polynomials are the points where the optimal value of the objective function is achieved</item> | ||
</itemize> | </itemize> | ||
| Line 21: | Line 22: | ||
<type>linear_programs</type> | <type>linear_programs</type> | ||
</types> | </types> | ||
| − | <see>Latte.Maximize</see> | + | <see>ApCoCoA-1:Latte.Maximize|Latte.Maximize</see> |
<key>lpsolve</key> | <key>lpsolve</key> | ||
Latest revision as of 15:05, 1 November 2020
| This article is about a function from ApCoCoA-1. If you are looking for the ApCoCoA-2 version of it, see Package glpk/GLPK.LPMax. |
GLPK.LPMax
Solving linear programmes by maximizing the objective function.
Syntax
GLPK.LPMax(Objective_f:POLY, Inequations:LIST, Bounds:LIST, Method:STRING) :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 Objective_f: A linear polynomial which is equivalent to the linear objective function.
@param Inequations: List of linear polynomials, which are equivalent to the conditions of the linear program of the form A <= 0.
@param Bounds: List of lists with two elements. Each List contains the lower and upper bounds for each variable. You can choose between INT or RAT for the type of each bound, if you type in a (empty) string, then it means minus infinity (first place) or plus infinity (second place).
@param Method: You can choose between the interior-point-method ("InterP") or the simplex-algorithm ("Simplex"). Usually you should use the simplex-algorithm.
@return List of linear polynomials, the zeros of the polynomials are the points where the optimal value of the objective function is achieved
