Difference between revisions of "ApCoCoA-1:GLPK.BPMin"

From ApCoCoAWiki
m (added version info)
 
(2 intermediate revisions by one other user not shown)
Line 1: Line 1:
 +
{{Version|1|[[Package glpk/GLPK.BPMin]]}}
 
<command>
 
<command>
 
<title>GLPK.BPMin</title>
 
<title>GLPK.BPMin</title>
Line 25: Line 26:
 
<key>minimize lp</key>
 
<key>minimize lp</key>
 
<key>GLPK.MIPSolve</key>
 
<key>GLPK.MIPSolve</key>
<wiki-category>Package_glpk</wiki-category>
+
<wiki-category>ApCoCoA-1:Package_glpk</wiki-category>
 
</command>
 
</command>

Latest revision as of 15:02, 1 November 2020

This article is about a function from ApCoCoA-1. If you are looking for the ApCoCoA-2 version of it, see Package glpk/GLPK.BPMin.

GLPK.BPMin

Solving mixed integer linear programmes by minimizing the objective function.

Syntax

GLPK.BPMin(Objective_f:POLY, Inequations:LIST) :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 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