On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions

DOI10.1016/S0167-6377(01)00063-3zbMath0992.90049WikidataQ126778044 ScholiaQ126778044MaRDI QIDQ5945383

Hanif D. Sherali

Publication date: 22 September 2002

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

locally ideal formulationspiecewise-linear approximationsseparable nonlinear programszero-one modeling

Mathematics Subject Classification ID

Mixed integer programming (90C11) Optimality conditions and duality in mathematical programming (90C46)

Related Items (24)

An efficient envelope-based branch and bound algorithm for non-convex combined heat and power production planning ⋮ Risk-based models for emergency shelter and exit design in buildings ⋮ Computing tight bounds via piecewise linear functions through the example of circle cutting problems ⋮ Evaluating and optimizing resilience of airport pavement networks ⋮ Global optimization for transport network expansion and signal setting ⋮ Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations ⋮ Mathematical programming formulations for piecewise polynomial functions ⋮ Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints ⋮ Two-stage stochastic mixed-integer nonlinear programming model for post-wildfire debris flow hazard management: mitigation and emergency evacuation ⋮ Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation ⋮ On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations ⋮ Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing ⋮ Models for representing piecewise linear cost functions ⋮ Nonconvex, lower semicontinuous piecewise linear optimization ⋮ Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem ⋮ Linearly constrained global optimization via piecewise-linear approximation ⋮ A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization ⋮ Compressor scheduling in oil fields. Piecewise-linear formulation, valid inequalities, and computational analysis ⋮ The hill detouring method for minimizing hinging hyperplanes functions ⋮ Modeling disjunctive constraints with a logarithmic number of binary variables and constraints ⋮ Piecewise-linear approximations of multidimensional functions ⋮ An effective logarithmic formulation for piecewise linearization requiring no inequality constraint ⋮ Piecewise Linear Function Fitting via Mixed-Integer Linear Programming ⋮ Comparative studies on dynamic programming and integer programming approaches for concave cost production/inventory control problems

Cites Work

• Approximating separable nonlinear functions via mixed zero-one programs
• Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Unnamed Item
• Unnamed Item

This page was built for publication: On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions