Difference between revisions of "Package glpk/GLPK.LPSolve"
Andraschko (talk | contribs) (Essentially copied from ApCoCoA-1:GLPK.LPSolve) |
Andraschko (talk | contribs) m (see also) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
| − | {{Version|1}} | + | {{Version|2|[[ApCoCoA-1:GLPK.LPSolve]]}} |
<command> | <command> | ||
<title>GLPK.LPSolve</title> | <title>GLPK.LPSolve</title> | ||
| Line 39: | Line 39: | ||
<type>list</type> | <type>list</type> | ||
</types> | </types> | ||
| + | <seealso> | ||
| + | <see>Package glpk/GLPK.MIPSolve</see> | ||
| + | <see>Package glpk/GLPK.LPMin</see> | ||
| + | <see>Package glpk/GLPK.LPMax</see> | ||
| + | </seealso> | ||
<key>lpsolve</key> | <key>lpsolve</key> | ||
Latest revision as of 15:32, 1 November 2020
| This article is about a function from ApCoCoA-2. If you are looking for the ApCoCoA-1 version of it, see ApCoCoA-1:GLPK.LPSolve. |
GLPK.LPSolve
Solving linear programmes.
Syntax
GLPK.LPSolve(Objective_f:POLY, EQ_Poly:LIST, LE_Poly:LIST, GE_Poly:LIST, Bounds:LIST, Method:STRING, MinMax: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 EQ_Poly: List of linear polynomials, which are equivalent to the equality-part in the list of conditions.
@param LE_Poly: List of linear polynomials, which are equivalent to the lower or equal-part in the list of conditions.
@param GE_Poly: List of linear polynomials, which are equivalent to the greater or equal-part in the list of conditions.
@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.
@param MinMax: Minimization ("Min") or maximization ("Max"), that's the question.
@return List of linear polynomials, the zeros of the polynomials are the points where the optimal value of the objective function is achieved
Example
-- We want to maximize the Function y = - 1/2x, -- with the two conditions y ≤ 6 - 3/4x and y ≥ 1 - x and the bounds 0 ≤ x ≤ 6 and 1/3 ≤ y ≤ 4. Use S ::= QQ[x,y]; OF := (1/2)*x + y; LE := [(3/4)*x + y - 6]; GE := [x + y - 1]; Bounds := [[0,6], [1/3,4]]; GLPK.LPSolve(OF, [], LE, GE, Bounds, "Simplex", "Max"); -- [266667/100000, 4]
See also
