A special ordered set approach for optimizing a discontinuous separable piecewise linear function
From MaRDI portal
Publication:935235
DOI10.1016/j.orl.2007.05.004zbMath1163.90758OpenAlexW2137477972MaRDI QIDQ935235
Ismael Regis jun. de Farias, Ming Zhao, Hong-xia Zhao
Publication date: 6 August 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2007.05.004
Related Items
The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints ⋮ Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems ⋮ Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints ⋮ A polyhedral study of the semi-continuous knapsack problem ⋮ Fitting piecewise linear continuous functions ⋮ Nonconvex, lower semicontinuous piecewise linear optimization ⋮ Polylithic modeling and solution approaches using algebraic modeling systems ⋮ Optimization problems for machine learning: a survey ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ On the Derivation of Continuous Piecewise Linear Approximating Functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Simulation of hybrid circuits in constraint logic programming
- Nonconvex, lower semicontinuous piecewise linear optimization
- Mixed integer minimization models for piecewise-linear functions of a single variable
- Models for representing piecewise linear cost functions
- Integer and mixed-integer programming models: General properties
- Mixed integer models for the stationary case of gas network optimization
- Branch-and-cut for combinatorial optimization problems without auxiliary binary variables
- 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
- Solving nonlinear resistive networks using piecewise-linear analysis and simplicial subdivision
- 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
