Integer Farkas Lemma
International Game Theory Review · 2015-03 · 17 (01) · 1540003
DOI: 10.1142/s0219198915400034 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Game Theory Review, online erschienen am 02.03.2015. Verfasst von R. Chandrasekaran. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 15 Literaturangaben.
Abstract (Originalsprache)
Farkas type results are available for solutions to linear systems. These can also include restrictions such as nonnegative solutions or integer solutions. They show that the unsolvability can be reduced to a single constraint that is not solvable and this condition is implied by the original system. Such a result does not exist for integer solution to inequality system because a single inequality is always solvable in integers. But a single equation that does not have nonnegative integer solution exists. We present some cases when polynomial algorithms to find nonnegative integer solutions exist.
Zitieren
APA
Chandrasekaran, R. (2015). Integer Farkas Lemma. International Game Theory Review, 17(01), 1540003. https://doi.org/10.1142/s0219198915400034
Vancouver
Chandrasekaran R. Integer Farkas Lemma. International Game Theory Review. 2015;17(01):1540003. doi:10.1142/s0219198915400034
BibTeX
@article{Chandrasekaran2015,
author = {Chandrasekaran, R.},
title = {Integer Farkas Lemma},
journal = {International Game Theory Review},
year = {2015},
volume = {17},
number = {01},
pages = {1540003},
doi = {10.1142/s0219198915400034}
}
EUVIMED