Keely L. Croxton

Learn More
We study a generic minimization problem with separable non-convex piecewise linear costs, showing that the linear programming (LP) relaxation of three textbook mixed-integer programming formulations each approximates the cost function by its lower convex envelope. We also show a relationship between this result and classical Lagrangian duality theory.
Network flow problems with non-convex piecewise linear cost structures arise in many application areas, most notably in freight transportation and supply chain management. In the present paper, we consider mixed-integer programming (MIP) formulations of a generic multi-commodity network flow problem with piecewise linear costs. The formulations we study are(More)
  • 1