Abstract
We consider the system of m linear equations in n integer variables Ax = d and give sufficient conditions for the uniqueness of its integer solution x ∈ {−1, 1}n by reformulating the problem as a linear program. Necessary and sufficient uniqueness characterizations of ordinary linear programming solutions are utilized to obtain sufficient uniqueness conditions such as the intersection of the kernel of A and the dual cone of a diagonal matrix of ±1’s is the origin in R n. This generalizes the well known condition that ker(A) = 0 for the uniqueness of a non-integer solution x of Ax = d. A zero maximum of a single linear program ensures the uniqueness of a given integer solution of a linear equation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balas E., Zemel E.: An algorithm for large zero–one knapsack problems. Oper. Res. 28, 1132–1154 (1980)
Fayard D., Plateau G.: An algorithm for the solution of the 0–1 knapsack problem. Computing 28, 269–287 (1982)
Horst R., Pardalos P., Thoai N.V.: Introduction to Global Optimization. Kluwer, Dodrecht (1995)
ILOG, Incline Village, Nevada. ILOG CPLEX 9.0 User’s Manual (2003). http://www.ilog.com/products/cplex/
Mangasarian O.L.: Uniqueness of solution in linear programming. Linear Algebra Appl. 25, 151–162 (1979)
Mangasarian, O.L.: Knapsack feasibility as an absolute value equation solvable by successive linear programming. Optim. Lett. 3, 161–170 (2009). ftp://ftp.cs.wisc.edu/pub/dmi/tech-reports/08-03.pdf. Optimization Letters online version: http://www.springerlink.com/content/7011287432285747/
Mangasarian, O.L., Recht, B.: Probability of unique integer solution to a system of linear equations. Technical Report 09-02, Data Mining Institute, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, September 2009. ftp://ftp.cs.wisc.edu/pub/dmi/tech-reports/09-02.pdf
MATLAB. User’s Guide. The MathWorks, Inc., Natick (1994–2006). http://www.mathworks.com
Motzkin, T.S.: Beiträge zur Theorie der Linearen Ungleichungen. Inaugural Dissertation, Jerusalem (1936)
Papadimitriou, C.H.: On the complexity of unique solution. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, pp. 14–20. IEEE CNF, Chicago (1982)
Prokopyev O.A., Huang H.-X., Pardalos P.M.: On complexity of unconstrained hyperbolic 0-1 programming problems. Oper. Res. Lett. 33, 312–318 (2005)
Valiant, L.G., Vazirani, V.V.: Np is as easy as detecting unique solutions. In: Annual ACM Symposium on Theory of Computing, Proceedings of the 17th Annual ACM Symposium on Theory of Computing, pp. 458–463. Association for Computing Machinery, New York (1985)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Mangasarian, O.L., Ferris, M.C. Uniqueness of integer solution of linear equations. Optim Lett 4, 559–565 (2010). https://doi.org/10.1007/s11590-010-0183-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-010-0183-0