Polyhedral methods for piecewise-linear functions. I: The lambda method
From MaRDI portal
This paper is dealing with the lambda-method, a method for using integer programming methods to model separable piecewise-linear functions. The authors extend this method to the nonseparable functions. They present theoretical aspects and provide an efficient separation algorithm for the facet-describing inequalities.
Recommendations
- Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
- Relationships among linear formulations of separable convex piecewise linear programs
- scientific article; zbMATH DE number 3916036
- Approximating separable nonlinear functions via mixed zero-one programs
- A note on ``A superior representation method for piecewise linear functions
Cites work
Cited in
(23)- Models for representing piecewise linear cost functions
- Global optimization for transport network expansion and signal setting
- Compact mixed-integer programming formulations in quadratic optimization
- On refinement strategies for solving \(\textsc{MINLP}\)s by piecewise linear relaxations: a generalized red refinement
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation
- Multiple criteria decision making for linguistic judgments with importance quantifier guided ordered weighted averaging operator
- Models and solution techniques for production planning problems with increasing byproducts
- A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization
- Piecewise linear approximation of functions of two variables in MILP models
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
- Locally ideal formulations for piecewise linear functions with indicator variables
- Mixed integer models for the stationary case of gas network optimization
- Piecewise polyhedral formulations for a multilinear term
- Mixed integer linear programming formulation techniques
- Optimistic MILP modeling of non-linear optimization problems
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
- Relationships among linear formulations of separable convex piecewise linear programs
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions
- Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions
- On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
- Bi-attribute utility preference robust optimization: a continuous piecewise linear approximation approach
This page was built for publication: Polyhedral methods for piecewise-linear functions. I: The lambda method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5929311)
