SOME COMPUTATIONAL EXPERIMENTS WITH A PRIMAL-DUAL SURROGATE SIMPLEX ALGORITHM

Wim van Dam and Jan Telgen

No 272174, Econometric Institute Archives from Erasmus University Rotterdam

Abstract: Computational experiments were performed with a primal-dual algorithm, using surrogate objective functions to solve the linear programming problem. Three different rules for switching between the primal and the dual problem and seven different ways to construct the surrogate objective function were used to solve 28 LP problems. For the moment it seems that the sum of the infeasibilities is the best indicator for attacking either the primal or the dual problem and that the sum of the violated constraints is the best surrogate objective function, judging by the number of iterations. . On the other.hand this version is shown to be not necessarily finite, while the other switching rules yield finite procedures. However, in Oneral the primal-dual surrogate simplex method clearly outperforms the twophase simplex method.

Keywords: Agricultural and Food Policy; Research and Development/Tech Change/Emerging Technologies (search for similar items in EconPapers)
Pages: 19
Date: 1978-12
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://ageconsearch.umn.edu/record/272174/files/erasmus110.pdf (application/pdf)
https://ageconsearch.umn.edu/record/272174/files/erasmus110.pdf?subformat=pdfa (application/pdf)

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:ags:eureia:272174

DOI: 10.22004/ag.econ.272174

Access Statistics for this paper

More papers in Econometric Institute Archives from Erasmus University Rotterdam Contact information at EDIRC.
Bibliographic data for series maintained by AgEcon Search ().