A framework for constructing general integer problems with well-determined duality gaps

DOI10.1016/S0377-2217(01)00035-2MaRDI QIDQ5955093zbMATH OpenFDO

Authors A. Joseph, Saul I. Gass

Publication date 2002

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0377-2217(01)00035-2

zbMATH Keywords

Duality gapGeneral integer programmingLinear programmingTest problem generation

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Integer programming (90C10)

Recommendations

• A Convergent Duality Theory for Integer Programming
• scientific article; zbMATH DE number 3891101
• scientific article; zbMATH DE number 3904332
• On the existence of duality gaps for mixed integer programming
• scientific article; zbMATH DE number 3922373

Cites work

• A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
• An exact ceiling point algorithm for general integer linear programming
• An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming
• An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem
• Cutting planes for integer programs with general integer variables
• Efficient Heuristic Procedures for Integer Linear Programming with an Interior
• Evaluating mathematical programming techniques. Proceedings of a Conference Held at the National Bureau of Standards, Boulder, Colorado, January 5-6, 1981
• Parametric formulation of the general integer linear programming problem

Cited in

(1)

• Duality gaps in stochastic integer programming

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication: A framework for constructing general integer problems with well-determined duality gaps

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