The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints

DOI10.1007/S10107-012-0517-ZzbMath1274.90331OpenAlexW1972097069MaRDI QIDQ378090

Ismael Regis jun. de Farias, Ming Zhao

Publication date: 11 November 2013

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-012-0517-z

zbMATH Keywords

knapsack problembranch-and-cutmixed-integer programmingsemi-continuous variablespiecewise linear optimizationpolyhedral methodspecial ordered set

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Combinatorial optimization (90C27)

Related Items (3)

Structural Investigation of Piecewise Linearized Network Flow Problems ⋮ Branch-and-cut for complementarity-constrained optimization ⋮ Mixed Integer Linear Programming Formulation Techniques

Uses Software

• AMPL

Cites Work

• Unnamed Item
• Unnamed Item
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
• Simulation of hybrid circuits in constraint logic programming
• A special ordered set approach for optimizing a discontinuous separable piecewise linear function
• Nonconvex, lower semicontinuous piecewise linear optimization
• Mixed integer minimization models for piecewise-linear functions of a single variable
• A polyhedral study of the cardinality constrained knapsack problem
• Models for representing piecewise linear cost functions
• Computational study of a family of mixed-integer quadratic programming problems
• Integer and mixed-integer programming models: General properties
• Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
• Piecewise linear approximation of functions of two variables in MILP models
• Mixed integer models for the stationary case of gas network optimization
• Branch-and-cut for combinatorial optimization problems without auxiliary binary variables
• Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
• A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
• On the Solution of Discrete Programming Problems
• On the Significance of Solving Linear Programming Problems with Some Integer Variables
• Large-Scale Portfolio Optimization
• A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
• Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
• A Discrete Optimization Approach to Large Scale Supply Networks Based on Partial Differential Equations
• Solving Large-Scale Zero-One Linear Programming Problems
• On triangulations for computing fixed points
• Solving nonlinear resistive networks using piecewise-linear analysis and simplicial subdivision
• Branch and Bound Methods for Mathematical Programming Systems
• Numerical Optimization
• Homotopies for computation of fixed points
• Nonlinear Programming
• Integer Programming and Combinatorial Optimization
• A generalized assignment problem with special ordered sets: a polyhedral approach.
• Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints
• A family of inequalities for the generalized assignment polytope

This page was built for publication: The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints