An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
type: Item
instance of: scholarly article
title: An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
zbMATH Open document ID: 1473.90128
author: Yanyan Li
published in: Computational Optimization and Applications
publication date: 2021-08-09T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7379831
zbMATH Keywords: nonlinear programming
zbMATH Keywords: nonconvex optimization
zbMATH Keywords: piecewise linearization
zbMATH Keywords: logarithmic method
zbMATH Keywords: inequality constraint
MaRDI profile type: Publication
full work available at URL: s10589-021-00285-4
OpenAlex ID: W3171713083
cites work: Modelling piecewise linear concave costs in a tree partitioning problem
cites work: A composite algorithm for a concave-cost network flow problem
cites work: Q3134873
cites work: Capacitated Network Design—Polyhedral Structure and Computation
cites work: On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures
cites work: Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures
cites work: Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
cites work: On the Significance of Solving Linear Programming Problems with Some Integer Variables
cites work: Exact solution of multicommodity network optimization problems with general step cost functions
cites work: Simulation of hybrid circuits in constraint logic programming
cites work: A branch-and-cut algorithm for capacitated network design problems
cites work: Q5538306
cites work: Solving the staircase cost facility location problem with decomposition and piecewise linearization
cites work: A Lagrangean heuristic for the facility location problem with staircase costs
cites work: Global optimization for the three-dimensional open-dimension rectangular packing problem
cites work: Modelling with integer variables
cites work: Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization
cites work: An efficient method for solving linear goal programming problems
cites work: An approximately global optimization method for assortment problems
cites work: Approximately global optimization for assortment problems using piecewise linearization techniques
cites work: An enhanced logarithmic method for signomial programming with discrete variables
cites work: A superior representation method for piecewise linear functions
cites work: A global optimization method for nonconvex separable programming problems
cites work: Some transformation techniques with applications in global optimization
cites work: Modeling and Solving the Two-Facility Capacitated Network Loading Problem
cites work: On the Solution of Discrete Programming Problems
cites work: Approximating separable nonlinear functions via mixed zero-one programs
cites work: On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
cites work: Locally ideal formulations for piecewise linear functions with indicator variables
cites work: Computing tight bounds via piecewise linear functions through the example of circle cutting problems
cites work: An optimization approach for supply chain management models with quantity discount policy
cites work: An efficient deterministic optimization approach for rectangular packing problems
cites work: A note on ``A superior representation method for piecewise linear functions''
cites work: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
DOI: 10.1007/S10589-021-00285-4
Recommended article: A piecewise time-linearized method for the logistic differential equation
Recommended article: A parametrization of piecewise linear Lyapunov functions via linear programming
Recommended article: A review of piecewise linearization methods
Recommended article: Piecewise linear methods for nonlinear equations and optimization
Recommended article: An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint
Recommended article: Piecewise-linearized methods for initial-value problems
Recommended article: An efficient algorithm for representing piecewise linear functions into logic
Recommended article: Efficient solution of the variational equation for piecewise-linear differential equations
description: scientific article; zbMATH DE number 7379831