The complexity of Zadeh's Pivot Rule / / Alexander Vincent Hopp.
The question whether linear programs can be solved in strongly polynomial time is a majoropen problem in the field of optimization. One promising candidate for an algorithm thatpotentially guarantees to solve any linear program in such time is the simplex algorithmof George Dantzig. This algorithm c...
Saved in:
| VerfasserIn: | |
|---|---|
| Place / Publishing House: | Germany : : Logos Verlag Berlin,, [2020] ©2020 |
| Year of Publication: | 2020 |
| Edition: | First edition. |
| Language: | English |
| Physical Description: | 1 online resource (xvi, 319 pages) :; illustrations; digital file(s). |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!