An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
From MaRDI portal
Publication:2044490
DOI10.1007/S10589-021-00285-4zbMATH Open1473.90128OpenAlexW3171713083MaRDI QIDQ2044490FDOQ2044490
Authors: Yanyan Li 
Publication date: 9 August 2021
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-021-00285-4
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
nonconvex optimizationnonlinear programminginequality constraintpiecewise linearizationlogarithmic method
Cites Work
- Title not available (Why is that?)
- An efficient method for solving linear goal programming problems
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Title not available (Why is that?)
- An optimization approach for supply chain management models with quantity discount policy
- Modelling with integer variables
- A superior representation method for piecewise linear functions
- Capacitated Network Design—Polyhedral Structure and Computation
- Some transformation techniques with applications in global optimization
- Effective zero-inventory-ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- On the Solution of Discrete Programming Problems
- Approximating separable nonlinear functions via mixed zero-one programs
- Computing tight bounds via piecewise linear functions through the example of circle cutting problems
- On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
- A Lagrangean heuristic for the facility location problem with staircase costs
- Solving the staircase cost facility location problem with decomposition and piecewise linearization
- Simulation of hybrid circuits in constraint logic programming
- A branch-and-cut algorithm for capacitated network design problems
- On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures
- A composite algorithm for a concave-cost network flow problem
- Modelling piecewise linear concave costs in a tree partitioning problem
- Approximately global optimization for assortment problems using piecewise linearization techniques
- Exact solution of multicommodity network optimization problems with general step cost functions
- A global optimization method for nonconvex separable programming problems
- Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization
- An approximately global optimization method for assortment problems
- Global optimization for the three-dimensional open-dimension rectangular packing problem
- Locally ideal formulations for piecewise linear functions with indicator variables
- An enhanced logarithmic method for signomial programming with discrete variables
- A note on ``A superior representation method for piecewise linear functions
- An efficient deterministic optimization approach for rectangular packing problems
Cited In (2)
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)
