Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem

DOI10.1023/A:1022632713397MaRDI QIDQ1265040zbMATH OpenOpenAlexFDO

Authors N. A. Bryson, A. Joseph, Saul I. Gass

Publication date 28 February 1999

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1022632713397

zbMATH Keywords

extreme pointsinteger programmingrelaxed linear-programming problemssolution bounds

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10)

Recommendations

• On the relationship between the optima of linear and integer linear programming
• scientific article; zbMATH DE number 4204114
• Tightness of sensitivity and proximity bounds for integer linear programs
• Complexity of linear relaxations in integer programming
• New class of 0-1 integer programs with tight approximation via linear relaxations
• scientific article; zbMATH DE number 3847219
• Refined proximity and sensitivity results in linearly constrained convex separable integer programming
• scientific article; zbMATH DE number 3511865
• scientific article; zbMATH DE number 27284
• On Proximity for k-Regular Mixed-Integer Linear Optimization

Cites work

• All-integer linear programming — a new approach via dynamic programming
• Integer Rounding for Polymatroid and Branching Optimization Problems
• Parametric formulation of the general integer linear programming problem

Cited in

(2)

• Two notes on the standard form of linear programming and the optimal solution of integer linear programming
• On Proximity for k-Regular Mixed-Integer Linear Optimization

This page was built for publication: Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1265040)