An effective logarithmic formulation for piecewise linearization requiring no inequality constraint

DOI10.1007/s10589-021-00285-4zbMath1473.90128OpenAlexW3171713083MaRDI QIDQ2044490

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

zbMATH Keywords

nonconvex optimizationnonlinear programminginequality constraintpiecewise linearizationlogarithmic method

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cites Work

• Unnamed Item
• Unnamed Item
• Computing tight bounds via piecewise linear functions through the example of circle cutting problems
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
• Simulation of hybrid circuits in constraint logic programming
• An optimization approach for supply chain management models with quantity discount policy
• Some transformation techniques with applications in global optimization
• A Lagrangean heuristic for the facility location problem with staircase costs
• An approximately global optimization method for assortment problems
• Exact solution of multicommodity network optimization problems with general step cost functions
• Modelling piecewise linear concave costs in a tree partitioning problem
• Solving the staircase cost facility location problem with decomposition and piecewise linearization
• Approximating separable nonlinear functions via mixed zero-one programs
• An enhanced logarithmic method for signomial programming with discrete variables
• A branch-and-cut algorithm for capacitated network design problems
• A global optimization method for nonconvex separable programming problems
• Approximately global optimization for assortment problems using piecewise linearization techniques
• Locally ideal formulations for piecewise linear functions with indicator variables
• An efficient method for solving linear goal programming problems
• An efficient deterministic optimization approach for rectangular packing problems
• A Note on “A Superior Representation Method for Piecewise Linear Functions”
• A Superior Representation Method for Piecewise Linear Functions
• Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures
• Modelling with integer variables
• On the Solution of Discrete Programming Problems
• On the Significance of Solving Linear Programming Problems with Some Integer Variables
• Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
• Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization
• 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
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Global optimization for the three-dimensional open-dimension rectangular packing problem
• Capacitated Network Design—Polyhedral Structure and Computation
• On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions

This page was built for publication: An effective logarithmic formulation for piecewise linearization requiring no inequality constraint