Approximating separable nonlinear functions via mixed zero-one programs
From MaRDI portal
Publication:1591598
DOI10.1016/S0167-6377(00)00028-6zbMath0960.90065MaRDI QIDQ1591598
Publication date: 20 December 2000
Published in: Operations Research Letters (Search for Journal in Brave)
locally ideal formulationsmixed-integer programmingnonlinear functionspieceswise linear approximation
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (43)
An efficient convexification method for solving generalized geometric problems ⋮ Ideal, non-extended formulations for disjunctive constraints admitting a network representation ⋮ Computing tight bounds via piecewise linear functions through the example of circle cutting problems ⋮ Staircase compatibility and its applications in scheduling and piecewise linearization ⋮ Piecewise polyhedral formulations for a multilinear term ⋮ Mathematical programming formulations for piecewise polynomial functions ⋮ Exact penalty and optimality condition for nonseparable continuous piecewise linear programming ⋮ Structural Investigation of Piecewise Linearized Network Flow Problems ⋮ Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints ⋮ Finding all solutions of separable systems of piecewise-linear equations using integer programming ⋮ Two-stage stochastic mixed-integer nonlinear programming model for post-wildfire debris flow hazard management: mitigation and emergency evacuation ⋮ Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation ⋮ Mixed integer linear models for the optimization of dynamical transport networks ⋮ On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations ⋮ Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing ⋮ Global solution of optimization problems with signomial parts ⋮ Locally ideal formulations for piecewise linear functions with indicator variables ⋮ Incremental and encoding formulations for mixed integer programming ⋮ Models for representing piecewise linear cost functions ⋮ Joint model of probabilistic-robust (probust) constraints applied to gas network optimization ⋮ Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem ⋮ Linearly constrained global optimization via piecewise-linear approximation ⋮ A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization ⋮ Compressor scheduling in oil fields. Piecewise-linear formulation, valid inequalities, and computational analysis ⋮ Modeling disjunctive constraints with a logarithmic number of binary variables and constraints ⋮ Optimizing water tanks in water distribution systems by combining network reduction, mathematical optimization and hydraulic simulation ⋮ Robust scheduling of parallel machines with sequence-dependent set-up costs ⋮ On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions ⋮ Piecewise linear approximation of functions of two variables in MILP models ⋮ Piecewise polyhedral relaxations of multilinear optimization ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ An effective logarithmic formulation for piecewise linearization requiring no inequality constraint ⋮ Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables ⋮ Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes ⋮ Piecewise Linear Function Fitting via Mixed-Integer Linear Programming ⋮ On the Derivation of Continuous Piecewise Linear Approximating Functions ⋮ Comparative studies on dynamic programming and integer programming approaches for concave cost production/inventory control problems ⋮ An effective linear approximation method for separable programming problems ⋮ Compact mixed-integer programming formulations in quadratic optimization ⋮ Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\) ⋮ Mixed integer models for the stationary case of gas network optimization ⋮ A modified goal programming model for piecewise linear functions ⋮ Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
Cites Work
This page was built for publication: Approximating separable nonlinear functions via mixed zero-one programs
