Package glpk/GLPK.BPMax: Difference between revisions
From ApCoCoAWiki
Andraschko (talk | contribs) Essentially copied from ApCoCoA-1:GLPK.BPMax |
Andraschko (talk | contribs) m see also |
||
| Line 7: | Line 7: | ||
</syntax> | </syntax> | ||
<description> | <description> | ||
<itemize> | <itemize> | ||
| Line 14: | Line 13: | ||
<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.LPMax</see> | |||
<see>Package glpk/GLPK.MIPMax</see> | |||
<see>Package glpk/GLPK.BPMin</see> | |||
</seealso> | |||
<types> | <types> | ||
<type>poly</type> | <type>poly</type> | ||
<type>poly_List</type> | <type>poly_List</type> | ||
</types> | </types> | ||
<key>mipsolve</key> | <key>mipsolve</key> | ||
<key>solve binary program</key> | <key>solve binary program</key> | ||
Latest revision as of 15:27, 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.BPMax. |
GLPK.BPMax
Solving binary programmes by maximizing the objective function.
Syntax
GLPK.BPMax(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
