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

@inproceedings{Tomlin1981ASE,
  title={A Suggested Extension of Special Ordered Sets to Non-Separable Non-Convex Programming Problems*},
  author={John A. Tomlin},
  year={1981}
}
This paper suggests a branch and bound method for solving non-separable non-convex programming problems where the nonlinearities are piecewise linearly approximated using the standard simplicial subdivision of the hypercube. The method is based on the algorithm for Special Ordered Sets, used with separable problems, but involves using two different types of branches to achieve valid approximations. 

Citations

Publications citing this paper.
SHOWING 1-10 OF 22 CITATIONS

Mixed Integer Models for the Stationary Case of Gas Network Optimization

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Non-convex mixed-integer nonlinear programming: A survey

VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A mixed integer approach for time-dependent gas network optimization

  • Optimization Methods and Software
  • 2010
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Instance Formats

Horand Gassmann, Jun Ma, Kipp Martin
  • 2009
VIEW 3 EXCERPTS
HIGHLY INFLUENCED

Automated Synthesis of Robust QFT-PID Controllers based on Piecewise Linear Approximations

  • 2018 IEEE 14th International Conference on Control and Automation (ICCA)
  • 2018
VIEW 1 EXCERPT
CITES BACKGROUND