The relationship between integer and real solutions of constrained convex programming

DOI10.1007/BF01586929zbMath0753.90049OpenAlexW2000079083MaRDI QIDQ1176807

David Magagnosc, Michael Werman

Publication date: 25 June 1992

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01586929

zbMATH Keywords

constrained optimizationproximity of the real and the integer solutions

Mathematics Subject Classification ID

Convex programming (90C25) Integer programming (90C10)

Related Items (9)

Proximity in concave integer quadratic programming ⋮ Refined proximity and sensitivity results in linearly constrained convex separable integer programming ⋮ Improving the Cook et al. proximity bound given integral valued constraints ⋮ The Gap Function: Evaluating Integer Programming Models over Multiple Right-Hand Sides ⋮ On the relationship between the integer and continuous solutions of convex programs ⋮ Distances between optimal solutions of mixed-integer programs ⋮ On Proximity for k-Regular Mixed-Integer Linear Optimization ⋮ New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems ⋮ Inverse optimization for linearly constrained convex separable programming problems

Cites Work

• The value function of a mixed integer program. II
• Sensitivity theorems in integer linear programming

This page was built for publication: The relationship between integer and real solutions of constrained convex programming