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

DOI10.1287/opre.1060.0277zbMath1167.90589MaRDI QIDQ3392024

Nemhauser, George I., Ismael Regis jun. de Farias, Ahmet Burak Keha

Publication date: 13 August 2009

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

Full work available at URL: https://doi.org/10.1287/opre.1060.0277

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

Related Items

A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints, Global optimization with spline constraints: a new branch-and-bound method based on B-splines, A branch-cut-and-price algorithm for the piecewise linear transportation problem, Dual-mode production planning for manufacturing with emission constraints, Computing tight bounds via piecewise linear functions through the example of circle cutting problems, The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints, On linear programs with linear complementarity constraints, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, A special ordered set approach for optimizing a discontinuous separable piecewise linear function, Nonconvex, lower semicontinuous piecewise linear optimization, A PLMF-based decomposition-coordination algorithm for fuzzy linear programming in industrial applications, On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization, The hill detouring method for minimizing hinging hyperplanes functions, Exact penalty and optimality condition for nonseparable continuous piecewise linear programming, Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints, Mathematical programming formulations for piecewise polynomial functions, Models and strategies for efficiently determining an optimal vertical alignment of roads, A family of inequalities valid for the robust single machine scheduling polyhedron, Solving linear programs with complementarity constraints using branch-and-cut, Global optimization of non-convex piecewise linear regression splines, Scheduling for a processor sharing system with linear slowdown, A polyhedral study of the semi-continuous knapsack problem, A parametric simplex algorithm for biobjective piecewise linear programming problems, Mixed Integer Linear Programming Formulation Techniques, Structural Investigation of Piecewise Linearized Network Flow Problems, Modeling and solving a multimodal transportation problem with flexible-time and scheduled services, Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints

Uses Software

• MINTO