A Strongly Polynomial Method for Solving Integer Max-Linear Optimization Problems in a Generic Case

P. Butkovic () and M. MacCaig ()
Additional contact information
P. Butkovic: University of Birmingham
M. MacCaig: University of Birmingham

Journal of Optimization Theory and Applications, 2015, vol. 165, issue 3, No 14, 963 pages

Abstract: Abstract We study the existence of integer solutions to max-linear optimization problems. Specifically, we show that, in a generic case, the integer max-linear optimization problem can be solved in strongly polynomial time. This extends results from our previous papers where polynomial methods for this generic case were given.

Keywords: Max-linear optimization problem; Integer vector; Max-linear system; 15A80 (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10957-014-0596-5 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:165:y:2015:i:3:d:10.1007_s10957-014-0596-5

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

DOI: 10.1007/s10957-014-0596-5

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 ().