New Conical Internally Evolutive Linear Programming Algorithm

P. D’Alessandro
Additional contact information
P. D’Alessandro: Third University of Rome

Journal of Optimization Theory and Applications, 2006, vol. 131, issue 2, No 3, 195-207

Abstract: Abstract Optimality in the range space is expressed as a tangency condition for an affine set and a cone. In a previous paper, an algorithm was introduced that reaches tangency keeping the two sets nonintersecting. Here, we introduce an exact finite-convergence evolutive algorithm that reaches tangency while keeping the two sets intersecting. In the process of developing the algorithm, we add some completion to the theory (e.g., the description of the contact polytope). Furthermore, we introduce a new formula to express the maximum, which is the primal counterpart of the dual formula introduced in a previous paper.

Keywords: Linear programming; range space; optimization; conical methods (search for similar items in EconPapers)
Date: 2006
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10957-006-9145-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:joptap:v:131:y:2006:i:2:d:10.1007_s10957-006-9145-1

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-006-9145-1

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().