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.
Supply chain management is increasingly being recognized as the integration of key business processes across the supply chain. For example, Hammer argues that now that companies have implemented processes within the firm, they need to integrate them between firms: Streamlining cross-company processes is the next great frontier for reducing costs, enhancing(More)
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)
The demand management process is concerned with balancing the customers' requirements with the capabilities of the supply chain. This includes forecasting demand and synchronizing it with production, procurement, and distribution capabilities. A good demand management process can enable a company to be more proactive to anticipated demand, and more reactive(More)
  • 1