Skip to main content
placeholder image

A global approximation model for the continuous network design problem

Conference Paper


Abstract


  • Continuous network design problem is often formulated as a bi-level program with equilibrium constraints, and only approximation solution can be obtained due to its non-convexity. Based on geometric programming, this paper develops an equivalent single-level model to find an approximated global optimal solution. The principle of solving this problem is to apply a monomial approximation method to transform it to an equivalent nonlinear but convex problem, which is amenable to a global solution.

Authors


  •   Du, Bo
  •   Wang, David (external author)

Publication Date


  • 2014

Citation


  • Du, B. & Wang, Z. (2014). A global approximation model for the continuous network design problem. INFORMS Annual Meeting

Abstract


  • Continuous network design problem is often formulated as a bi-level program with equilibrium constraints, and only approximation solution can be obtained due to its non-convexity. Based on geometric programming, this paper develops an equivalent single-level model to find an approximated global optimal solution. The principle of solving this problem is to apply a monomial approximation method to transform it to an equivalent nonlinear but convex problem, which is amenable to a global solution.

Authors


  •   Du, Bo
  •   Wang, David (external author)

Publication Date


  • 2014

Citation


  • Du, B. & Wang, Z. (2014). A global approximation model for the continuous network design problem. INFORMS Annual Meeting