# Difference between revisions of "ApCoCoA-1:GLPK.MIPSolve"

Line 16: | Line 16: | ||

<item>@param <em>IntNum</em>: List of variables, which should be integer. <em>Note</em>: For each variable in this list, the borders get rounded (lower bound: up and upper bound: down). In the case that the lower rounded bound becomes greater then the upper rounded bound, glpk returns: Solution Status: INTEGER UNDEFINED - Value of objective function: 0.</item> | <item>@param <em>IntNum</em>: List of variables, which should be integer. <em>Note</em>: For each variable in this list, the borders get rounded (lower bound: up and upper bound: down). In the case that the lower rounded bound becomes greater then the upper rounded bound, glpk returns: Solution Status: INTEGER UNDEFINED - Value of objective function: 0.</item> | ||

<item>@param <em>Binaries</em>: List of variables, which should be binaries (0 or 1).</item> | <item>@param <em>Binaries</em>: List of variables, which should be binaries (0 or 1).</item> | ||

− | <item>@param <em>MinMax</em>: Minimization ( | + | <item>@param <em>MinMax</em>: Minimization (<quotes>Min</quotes>) or maximization (<quotes>Max</quotes>), that's the question.</item> |

<item>@return List of linear polynomials, the zeros of the polynomials are the points where the optimal value of the objective function is archieved</item> | <item>@return List of linear polynomials, the zeros of the polynomials are the points where the optimal value of the objective function is archieved</item> | ||

</itemize> | </itemize> | ||

Line 33: | Line 33: | ||

Then we compute the solution with | Then we compute the solution with | ||

− | GLPK.MIPSolve(OF, [], LE, GE, Bounds, IntNum, [], | + | GLPK.MIPSolve(OF, [], LE, GE, Bounds, IntNum, [], <quotes>Max</quotes>); |

## Revision as of 13:32, 27 April 2009

## GLPK.MIPSolve

Solving linear programmes.

### Syntax

GLPK.MIPSolve(Objective_f:POLY, EQ_Poly:LIST, LE_Poly:LIST, GE_Poly:LIST, Bounds:LIST, IntNum:LIST, Binaries:LIST, MinMax:STRING)

### 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

*IntNum*: List of variables, which should be integer.*Note*: For each variable in this list, the borders get rounded (lower bound: up and upper bound: down). In the case that the lower rounded bound becomes greater then the upper rounded bound, glpk returns: Solution Status: INTEGER UNDEFINED - Value of objective function: 0.@param

*Binaries*: List of variables, which should be binaries (0 or 1).@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 archieved

#### 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. -- We prename the input of GLPK.MIPSolve-function. Use S::=Q[x,y]; OF := 1/2x + y; LE := [3/4x + y - 6]; GE := [x + y - 1]; Bounds:=[[0,6], [1/3,4]]; IntNum:=[x,y]; Then we compute the solution with GLPK.MIPSolve(OF, [], LE, GE, Bounds, IntNum, [], <quotes>Max</quotes>); And we achieve: Solution Status: INTEGER OPTIMAL Value of objective function: 5 [x[1] - 2, x[2] - 4]