Piecewise linear approximation of functions of two variables in MILP models
From MaRDI portal
Publication:2270322
DOI10.1016/j.orl.2009.09.005zbMath1182.90064MaRDI QIDQ2270322
Andrea Lodi, Claudia D'Ambrosio, Silvano Martello
Publication date: 18 March 2010
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2009.09.005
mixed integer linear programming; piecewise linear approximation; non-linear functions of two variables
Related Items
Optimistic MILP modeling of non-linear optimization problems, The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints, Application-oriented mixed integer non-linear programming, Experiments on virtual private network design with concave capacity costs, Continuous piecewise linear delta-approximations for bivariate and multivariate functions, Piecewise linear bounding of univariate nonlinear functions and resulting mixed integer linear programming-based solution methods, Large-scale unit commitment under uncertainty: an updated literature survey, An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs, Joint location and pricing within a user-optimized environment, Large-scale unit commitment under uncertainty, Joint chance constrained programming for hydro reservoir management, Mixed Integer Linear Programming Formulation Techniques
Cites Work
- Unnamed Item
- Unnamed Item
- Piece-wise linear approximation of functions of two variables
- Models for representing piecewise linear cost functions
- Approximating separable nonlinear functions via mixed zero-one programs
- Mixed integer models for the stationary case of gas network optimization
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- Modelling with integer variables
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
- A Suggested Extension of Special Ordered Sets to Non-Separable Non-Convex Programming Problems
- Polyhedral methods for piecewise-linear functions. I: The lambda method