The relationship between integer and real solutions of constrained convex programming

Michael Werman*, David Magagnosc

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

12 Scopus citations

Abstract

We prove the following theorem which gives a bound on the proximity of the real and the integer solutions to certain constrained optimization programs.

Original languageAmerican English
Pages (from-to)133-135
Number of pages3
JournalMathematical Programming
Volume51
Issue number1-3
DOIs
StatePublished - Jul 1991

Keywords

  • Convex programming
  • integer programming
  • linear programming

Fingerprint

Dive into the research topics of 'The relationship between integer and real solutions of constrained convex programming'. Together they form a unique fingerprint.

Cite this