HP50G SIMPLEX Version14b Max Min Pivot Algorithm, multiple/unbounded, unfeasible sol
|
12-15-2022, 12:17 AM
(This post was last modified: 01-04-2023 01:42 PM by Gil.)
Post: #9
|
|||
|
|||
RE: HP49-50G Version 7f Simplex Max Min Pivot Algorithm, multiple/unbounded solutions
Important
When given, the more general solution (in function of a lambda parameter) should be now exhaustive and does correspond fully to the paper "A Way to Find All the Optimal Solutions in Linear Programming", by Zuo Xiaode, Xue Shengjia & Luo Lei, to be found at https://ieeexplore.ieee.org/stamp/stamp....er=6075407 Contrarily to what I wrote previously, the solutions given in the above Paper are perfectly correct (my earlier transcription of the restrictions contained an error) — and my versions after 8e have been accordingly modified into: Lambda × Sol1 + (1-Lamda) × Sol2, with 0<= Lambda <= 1. |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 1 Guest(s)