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

DOI10.1016/S0304-0208(08)73476-5MaRDI QIDQ3923953zbMATH OpenOpenAlexFDO

Authors

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

branch and bound methodhypercubenon-separable non-convex programmingsimplicial subdivision

Mathematics Subject Classification ID

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

Cited in

(12)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3923953)