Representations of unbounded optimization problems as integer programs

DOI10.1007/BF00935492zbMATH Open0393.90062OpenAlexW2015787199MaRDI QIDQ1252154FDOQ1252154

Authors: Robert G. Jeroslow 

Publication date: 1980

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

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

zbMATH Keywords

Integer ProgramsRepresentations of Unbounded Optimization Problems

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Convex Analysis
• Integer programming formulation of combinatorial optimization problems
• Experimental logics and \(\Delta^0_2\)-theories
• Integer and mixed-integer programming models: General properties
• Transformation of integer programs to knapsack problems
• Group-Theoretic Results in Mixed Integer Programming

Cited In (7)

• Representability in mixed integer programming. I: Characterization results
• The number of additional variables required for the integer programming formulation
• Representability of functions
• Mixed integer linear programming formulation techniques
• A simplification for some disjunctive formulations
• Ellipsoidal mixed-integer representability
• On the Mixed Binary Representability of Ellipsoidal Regions

This page was built for publication: Representations of unbounded optimization problems as integer programs

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