Artificial Free Clone Of Simplex Method For Feasibility
Сохранить в:
| Опубликовано в:: | arXiv.org (May 6, 2013), p. n/a |
|---|---|
| Главный автор: | |
| Другие авторы: | , |
| Опубликовано: |
Cornell University Library, arXiv.org
|
| Предметы: | |
| Online-ссылка: | Citation/Abstract Full text outside of ProQuest |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 2084938963 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 2331-8422 | ||
| 035 | |a 2084938963 | ||
| 045 | 0 | |b d20130506 | |
| 100 | 1 | |a Muhammad Imtiaz | |
| 245 | 1 | |a Artificial Free Clone Of Simplex Method For Feasibility | |
| 260 | |b Cornell University Library, arXiv.org |c May 6, 2013 | ||
| 513 | |a Working Paper | ||
| 520 | 3 | |a This paper presents a method which is identical to simplex method phase 1, but do not need any artificial variable (or artificial constraints). So, the new method works in original variable space but visits the same sequence of pivots as simplex method does. Recently, (Inayatullah, Khan, Imtiaz & Khan, New artificial-free Phase 1 Simplex Method, 2009) claimed a similar method, here in this paper we have presented a counter example which shows in some special conditions of degeneracy their method may deviate from the simplex path. Because of its simplicity, the method presented in this paper is highly classroom oriented. So, indeed there is no need to work with artificial variables (or artificial constraints) in simplex method any more. | |
| 653 | |a Simplex method | ||
| 700 | 1 | |a Nasir Touheed | |
| 700 | 1 | |a Inayatullah, Syed | |
| 773 | 0 | |t arXiv.org |g (May 6, 2013), p. n/a | |
| 786 | 0 | |d ProQuest |t Engineering Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/2084938963/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |
| 856 | 4 | 0 | |3 Full text outside of ProQuest |u http://arxiv.org/abs/1304.6894 |