An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
From MaRDI portal
Recommendations
- A piecewise time-linearized method for the logistic differential equation
- A parametrization of piecewise linear Lyapunov functions via linear programming
- A review of piecewise linearization methods
- Piecewise linear methods for nonlinear equations and optimization
- An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint
- Piecewise-linearized methods for initial-value problems
- An efficient algorithm for representing piecewise linear functions into logic
- Efficient solution of the variational equation for piecewise-linear differential equations
Cites work
- A branch-and-cut algorithm for capacitated network design problems
- A composite algorithm for a concave-cost network flow problem
- A global optimization method for nonconvex separable programming problems
- A Lagrangean heuristic for the facility location problem with staircase costs
- A note on ``A superior representation method for piecewise linear functions
- A superior representation method for piecewise linear functions
- An approximately global optimization method for assortment problems
- An efficient deterministic optimization approach for rectangular packing problems
- An efficient method for solving linear goal programming problems
- An enhanced logarithmic method for signomial programming with discrete variables
- An optimization approach for supply chain management models with quantity discount policy
- Approximately global optimization for assortment problems using piecewise linearization techniques
- Approximating separable nonlinear functions via mixed zero-one programs
- Capacitated Network Design—Polyhedral Structure and Computation
- Computing tight bounds via piecewise linear functions through the example of circle cutting problems
- Effective zero-inventory-ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures
- Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization
- Exact solution of multicommodity network optimization problems with general step cost functions
- Global optimization for the three-dimensional open-dimension rectangular packing problem
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 3249566 (Why is no real title available?)
- Locally ideal formulations for piecewise linear functions with indicator variables
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Modelling piecewise linear concave costs in a tree partitioning problem
- Modelling with integer variables
- On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
- On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- On the Solution of Discrete Programming Problems
- Simulation of hybrid circuits in constraint logic programming
- Solving the staircase cost facility location problem with decomposition and piecewise linearization
- Some transformation techniques with applications in global optimization
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
Cited in
(5)- Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\)
- A superior representation method for piecewise linear functions
- A review of piecewise linearization methods
- Pump scheduling optimization in water distribution system based on mixed integer linear programming
- LinA: a faster approach to piecewise linear approximations using corridors and its application to mixed-integer optimization
This page was built for publication: An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2044490)
