A result in surrogate duality for certain integer programming problems

DOI10.1007/BF01582282zbMath0675.90065OpenAlexW2091996859MaRDI QIDQ1122485

Balasubramanian Ram, Mark H. Karwan

Publication date: 1989

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

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

zbMATH Keywords

linear equationsAggregationsurrogate constraint

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Linear programming (90C05)

Related Items (3)

Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach ⋮ On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints ⋮ On the existence of duality gaps for mixed integer programming

Cites Work

• Aggregation of constraints in integer programming
• Transformation of integer programs to knapsack problems
• Technical Note—Solving Integer Programming Problems by Aggregating Constraints
• Aggregating diophantine equations
• Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach

This page was built for publication: A result in surrogate duality for certain integer programming problems