Simplex method in prime how to use the constrains maximise s.t. constraints.
|
11-09-2023, 12:09 PM
Post: #34
|
|||
|
|||
RE: Simplex method in prime how to use the constrains maximise s.t. constraints.
simplex_reduce will solve a maximization problem with inequality constraints like 2x+4y<=22, not >=.
From the doc: Reduction by simplex algorithm to find max(c.x) under A.x<=b and x>=0, b>=0. Returns the maximum, the augmented solution x and the reduced matrix. It's unclear for me if it's possible to rewrite the initial problem and call simplex_reduce. Changing the sign of c would replace a max by a min, but you can't change sign of x (since x>=0), and if you negate Ax>=b, b would become <=0 instead of >=0 The COBYLA solver (in solve.cc in giac) could be added to the Prime codebase, we would probably have to display the license in the Terminal: Code:
|
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 10 Guest(s)