A Suggested Extension of Special Ordered Sets to Non-Separable Non-Convex Programming Problems

DOI10.1016/S0304-0208(08)73476-5zbMath0469.90068OpenAlexW110184996MaRDI QIDQ3923953

No author found.

Publication date: 1981

Published in: North-Holland Mathematics Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73476-5

zbMATH Keywords

hypercubesimplicial subdivisionbranch and bound methodnon-separable non-convex programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Linear programming (90C05)

Related Items (12)

Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints ⋮ Mixed integer linear models for the optimization of dynamical transport networks ⋮ An analytical approach to global optimization ⋮ Branch and bound, integer, and non-integer programming ⋮ Models and strategies for efficiently determining an optimal vertical alignment of roads ⋮ Modeling disjunctive constraints with a logarithmic number of binary variables and constraints ⋮ Piecewise linear approximation of functions of two variables in MILP models ⋮ Fast feasibility check of the multi-material vertical alignment problem in road design ⋮ Global optimization of signomial mixed-integer nonlinear programming problems with free variables ⋮ Mixed integer models for the stationary case of gas network optimization ⋮ A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design ⋮ Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production

This page was built for publication: A Suggested Extension of Special Ordered Sets to Non-Separable Non-Convex Programming Problems