A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation
Marianna E. Nagy and
Anita Varga
Authors registered in the RePEc Author Service: Marianna Eisenberg-Nagy
Corvinus Economics Working Papers (CEWP) from Corvinus University of Budapest
Abstract:
In this paper, we investigate a new primal-dual long-step interior point algorithm for linear optimization. Based on the step-size, interior point algorithms can be divided into two main groups, short-step and long-step methods. In practice, long-step variants perform better, but usually, a better theoretical complexity can be achieved for the short-step methods. One of the exceptions is the large-update algorithm of Ai and Zhang. The new wide neighbourhood and the main characteristics of the presented algorithm are based on their approach. In addition, we use the algebraic equivalent transformation technique by Darvay to determine the search directions of the method.
Keywords: Mathematical programming; Linear optimization; Interior point algorithms; Algebraic equivalent transformation technique (search for similar items in EconPapers)
JEL-codes: C61 (search for similar items in EconPapers)
Date: 2021-09-09
New Economics Papers: this item is included in nep-isf and nep-ore
References: Add references at CitEc
Citations:
Downloads: (external link)
https://unipub.lib.uni-corvinus.hu/6771/ original version (application/pdf)
Related works:
Journal Article: A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation (2023) 
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:cvh:coecwp:2021/06
Access Statistics for this paper
More papers in Corvinus Economics Working Papers (CEWP) from Corvinus University of Budapest 1093 Budapest, Fõvám tér 8.. Contact information at EDIRC.
Bibliographic data for series maintained by Adam Hoffmann ().