Mixed integer minimization models for piecewise-linear functions of a single variable

DOI10.1016/0012-365X(76)90145-XzbMath0348.90133OpenAlexW1973012206MaRDI QIDQ1234631

Robert R. Meyer

Publication date: 1976

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(76)90145-x

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

Representability in mixed integer programming. I: Characterization results, On the Mixed Binary Representability of Ellipsoidal Regions, A simplification for some disjunctive formulations, The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints, An algebra for piecewise-linear minimax problems, Branch-and-cut for complementarity-constrained optimization, A special ordered set approach for optimizing a discontinuous separable piecewise linear function, A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, Integer programming formulation of combinatorial optimization problems, The value function of a mixed integer program: I, Ellipsoidal mixed-integer representability, Mixed Integer Linear Programming Formulation Techniques, Two mixed integer programming formulations arising in manufacturing management, Representability of functions, Constructive characterizations of the value-function of a mixed-integer program. I, Stability in disjunctive optimization II:continuity of the feasible and optimal set

Cites Work

• Unnamed Item
• Integer and mixed-integer programming models: General properties
• On the continuity of the minimum set of a continuous function