# Difference between revisions of "Package glpk/GLPK.BPMin"

From ApCoCoAWiki

Andraschko (talk | contribs) (Essentially copied from ApCoCoA-1:GLPK.BPMin) |
Andraschko (talk | contribs) m (see also) |
||

Line 7: | Line 7: | ||

</syntax> | </syntax> | ||

<description> | <description> | ||

− | |||

− | |||

<itemize> | <itemize> | ||

<item>@param <em>Objective_f</em>: A linear polynomial which is equivalent to the linear objective function.</item> | <item>@param <em>Objective_f</em>: A linear polynomial which is equivalent to the linear objective function.</item> | ||

Line 14: | Line 12: | ||

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

− | |||

</description> | </description> | ||

+ | <seealso> | ||

+ | <see>Package glpk/GLPK.LPMin</see> | ||

+ | <see>Package glpk/GLPK.MIPMin</see> | ||

+ | <see>Package glpk/GLPK.BPMax</see> | ||

+ | </seealso> | ||

<types> | <types> | ||

<type>poly</type> | <type>poly</type> |

## Latest revision as of 15:29, 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.BPMin. |

## GLPK.BPMin

Solving mixed integer linear programmes by minimizing the objective function.

### Syntax

GLPK.BPMin(Objective_f:POLY, Inequations:LIST) :LIST

### Description

@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

### See also