Models for representing piecewise linear cost functions

Authors:
Ahmet B. Keha;Ismael R. De Farias, Jr.;George L. Nemhauser
Affiliations:
School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta, GA 30332-0205, USA;Graduate School of Industrial Administration, Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA 15213, USA;School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta, GA 30332-0205, USA
Venue:
Operations Research Letters
Year:
2004

Citing 11
Cited 16

Computational study of a family of mixed-integer quadratic programming problems

Mathematical Programming: Series A and B
Disjunctive programming: properties of the convex hull of feasible points

Discrete Applied Mathematics
Polyhedral methods for piecewise-linear functions I: the lambda method

Discrete Applied Mathematics
A Polyhedral Study of the Cardinality Constrained Knapsack Problem

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Facets of the Complementarity Knapsack Polytope

Mathematics of Operations Research
A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems

Management Science
Branch-and-cut for combinatorial optimization problems without auxiliary binary variables

The Knowledge Engineering Review
A scheme for unifying optimization and constraint satisfaction methods

The Knowledge Engineering Review
Approximating separable nonlinear functions via mixed zero-one programs

Operations Research Letters
A family of inequalities for the generalized assignment polytope

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

Operations Research Letters

A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization

Operations Research
Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs

Operations Research
Post-pruning in decision tree induction using multiple performance measures

Computers and Operations Research
Post-pruning in regression tree induction: An integrated approach

Expert Systems with Applications: An International Journal
0-1 reformulations of the multicommodity capacitated network design problem

Discrete Applied Mathematics
Piecewise polynomial interpolations and approximations of one-dimensional functions through mixed integer linear programming

Optimization Methods & Software - GLOBAL OPTIMIZATION
Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions

Operations Research
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
An approximation approach for representing S-shaped membership functions

IEEE Transactions on Fuzzy Systems
The hill detouring method for minimizing hinging hyperplanes functions

Computers and Operations Research
Design of assembly lines with the concurrent consideration of productivity and upper extremity musculoskeletal disorders using linear models

Computers and Industrial Engineering
A special ordered set approach for optimizing a discontinuous separable piecewise linear function

Operations Research Letters
Piecewise linear approximation of functions of two variables in MILP models

Operations Research Letters
Nonconvex, lower semicontinuous piecewise linear optimization

Discrete Optimization
On linear programs with linear complementarity constraints

Journal of Global Optimization
Models and strategies for efficiently determining an optimal vertical alignment of roads

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study formulations of linear programs with piecewise linear objective functions with and without additional binary variables. We show that the two formulations without additional binary variables have the same LP bounds as those of the corresponding formulations with binary variables and therefore are preferable for efficient computation.