Integer Farkas Lemma

R. Chandrasekaran ()
Additional contact information
R. Chandrasekaran: Department of Computer Science, University of Texas at Dallas, Richardson, Texas, USA

International Game Theory Review (IGTR), 2015, vol. 17, issue 01, 1-9

Abstract: 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.

Keywords: Farkas Lemma; linear systems; integer solutions (search for similar items in EconPapers)
JEL-codes: B4 C0 C6 C7 D5 D7 M2 (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0219198915400034
Access to full text is restricted to subscribers

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:wsi:igtrxx:v:17:y:2015:i:01:n:s0219198915400034

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0219198915400034

Access Statistics for this article

International Game Theory Review (IGTR) is currently edited by David W K Yeung

More articles in International Game Theory Review (IGTR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().