Version 1
: Received: 21 November 2019 / Approved: 22 November 2019 / Online: 22 November 2019 (10:06:37 CET)
How to cite:
Badr, E.; Aloufi, K. On a Dual Direct Cosine Simplex Type Algorithm and Its Computational Behavior. Preprints2019, 2019110262. https://doi.org/10.20944/preprints201911.0262.v1
Badr, E.; Aloufi, K. On a Dual Direct Cosine Simplex Type Algorithm and Its Computational Behavior. Preprints 2019, 2019110262. https://doi.org/10.20944/preprints201911.0262.v1
Badr, E.; Aloufi, K. On a Dual Direct Cosine Simplex Type Algorithm and Its Computational Behavior. Preprints2019, 2019110262. https://doi.org/10.20944/preprints201911.0262.v1
APA Style
Badr, E., & Aloufi, K. (2019). On a Dual Direct Cosine Simplex Type Algorithm and Its Computational Behavior. Preprints. https://doi.org/10.20944/preprints201911.0262.v1
Chicago/Turabian Style
Badr, E. and khalid Aloufi. 2019 "On a Dual Direct Cosine Simplex Type Algorithm and Its Computational Behavior" Preprints. https://doi.org/10.20944/preprints201911.0262.v1
Abstract
The goal of this paper is to propose a dual version of the direct 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. The utility of the proposed method is evident from the extensive computational results on test problems adapted from NETLIB. Preliminary results indicate that this dual direct cosine simplex algorithm (DDCA) reduces the number of iterations of two-phase method.
Keywords
linear programming; dual simplex method; dual direct cosine method; two-phase method
Subject
Computer Science and Mathematics, Computational Mathematics
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
