Difference between revisions of "ApCoCoA-1:GLPK.BPMax"
From ApCoCoAWiki
(New page: <command> <title>GLPK.BPMax</title> <short_description>Solving binary programmes by maximizing the objective function.</short_description> <syntax> GLPK.BPMax(Objective_f:POLY, Inequations...) |
m (Bot: Category moved) |
||
| Line 25: | Line 25: | ||
<key>maximize lp</key> | <key>maximize 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> | ||
Revision as of 16:12, 2 October 2020
GLPK.BPMax
Solving binary programmes by maximizing the objective function.
Syntax
GLPK.BPMax(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
