Preprint Article Version 1 This version is not peer-reviewed

On a Dual Direct Cosine Simplex Type Algorithm and Its Computational Behavior

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. Preprints 2019, 2019110262 (doi: 10.20944/preprints201911.0262.v1). Badr, E.; Aloufi, K. On a Dual Direct Cosine Simplex Type Algorithm and Its Computational Behavior. Preprints 2019, 2019110262 (doi: 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.

Subject Areas

linear programming; dual simplex method; dual direct cosine method; two-phase method

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.