|This article is about a function from ApCoCoA-2. If you are looking for the ApCoCoA-1 version of it, see ApCoCoA-1:GLPK.BPMin.|
Solving mixed integer linear programmes by minimizing the objective function.
GLPK.BPMin(Objective_f:POLY, Inequations:LIST) :LIST
@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.
@return List of linear polynomials, the zeros of the polynomials are the points where the optimal value of the objective function is achieved