Search
Member List
Calendar
Help
HP Forums
/
HP Calculators (and very old HP Computers)
/
HP Prime 
/
Simplex method in prime how to use the constrains maximise s.t. constraints.
/
Simplex method in prime how to use the constrains maximise s.t. constraints.
|
Simplex method in prime how to use the constrains maximise s.t. constraints.
|
|
11-16-2023, 11:47 PM
(This post was last modified: 11-16-2023 11:51 PM by ftneek.)
Post: #63
|
|||
|
|||
|
RE: Simplex method in prime how to use the constrains maximise s.t. constraints.
This one detected infinite solutions.
> simplex2([[1,2,1,0,5],[1,1,0,1,4],[-2,-4,0,0,0]],{3,4},4,0,0) [-10,[-3*t+3,(3*t+2)/2,0,3*t/2],[[1/2,1,1/2,0,5/2],[1/2,0,-1/2,1,3/2],[0,0,2,0,10]]] Meaning infinite solutions for 0≤t≤1. Also the algorithm assumes minimization. So for max=-min=10 - neek |
|||
|
|
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 6 Guest(s)