| Type: |
Conference |
| Place: |
|
| Name: |
2nd International Conference on Mathematics, Statistics & Information Technology (2nd ICMSIT-2018) 18-20 Dec 2018, Tanta, Egypt. |
| Start Date: |
2018-12-18 |
| End Date: |
2018-12-20 |
| Report: |
|
| Note: |
Abstract. The goal of this paper is to propose a dual version of the cosine simplex algorithm (DDCA) for general linear problems. Unlike the two-phase and the big-M methods, our technique does not involve artificial variables. Our technique solves the dual Klee-Minty problem in two iterations and solves the dual Clausen’s problem in four iterations. Preliminary results indicate that this dual cosine simplex algorithm (DDCA) reduces the number of two-phase and dual simplex iterations. |
|
