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

Elsayed Badr and Sultan Almotairi

Mathematical Problems in Engineering, 2020, vol. 2020, 1-8

Abstract:

The goal of this paper is to propose a dual version of the direct cosine simplex algorithm (DDCA) for general linear problems. The proposed method has not artificial variables, so it is different from both the two-phase method and big-M method. Our technique solves the dual Klee–Minty problem via two iterations and solves the dual Clausen problem via four iterations. The power of the proposed algorithm is evident from the extensive experimental results on benchmark problems adapted from NETLIB. Preliminary results indicate that this dual direct cosine simplex algorithm (DDCA) reduces the number of iterations of the two-phase method.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2020/7361092.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2020/7361092.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:7361092

DOI: 10.1155/2020/7361092

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().