The relationship between integer and real solutions of constrained convex programming (Q1176807)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The relationship between integer and real solutions of constrained convex programming |
scientific article; zbMATH DE number 12551
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The relationship between integer and real solutions of constrained convex programming |
scientific article; zbMATH DE number 12551 |
Statements
The relationship between integer and real solutions of constrained convex programming (English)
0 references
25 June 1992
0 references
This short communication presents two extensions to the convex case for some previous results of \textit{W. Cook, A. M. H. Gerards, A. Schrijver} and \textit{É. Tardos} [Math. Program. 34, No. 3, 251-264 (1986; Zbl 0648.90055)] and \textit{C. E. Blair} and \textit{R. G. Jeroslow} [Discrete Math. 25, 7-19 (1979; Zbl 0408.90055)] relating to the proximity of the real and the integer solutions to certain constrained optimization programs.
0 references
proximity of the real and the integer solutions
0 references
constrained optimization
0 references
0 references
0.88634145
0 references
0.88349354
0 references
0.8775976
0 references
0.8745485
0 references
0.8744873
0 references
