Representations of unbounded optimization problems as integer programs
From MaRDI portal
Publication:1252154
DOI10.1007/BF00935492zbMath0393.90062OpenAlexW2015787199MaRDI QIDQ1252154
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
Related Items (7)
Representability in mixed integer programming. I: Characterization results ⋮ On the Mixed Binary Representability of Ellipsoidal Regions ⋮ A simplification for some disjunctive formulations ⋮ The number of additional variables required for the integer programming formulation ⋮ Ellipsoidal mixed-integer representability ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ Representability of functions
Cites Work
- Experimental logics and \(\Delta^0_2\)-theories
- Integer programming formulation of combinatorial optimization problems
- Integer and mixed-integer programming models: General properties
- Transformation of integer programs to knapsack problems
- Convex Analysis
- Group-Theoretic Results in Mixed Integer Programming
This page was built for publication: Representations of unbounded optimization problems as integer programs
