A separation heuristic for mixed integer programs is presented that theoretically allows one to derive several families of " strong" valid inequalities for specific models and compuationally gives results as good as or better than those obtained from several existing separation routines...

In this paper we develop new primal-dual interior-point methods for linear programming, which are based on the concept of parabolic target space. We show that such schemes work in the infinity-neighborhood of the primal-dual central path. Nevertheless these methods possess the best known...

BC-PROD is a prototype modelling and optimization system designed and able to tackle a wide variety of the discrete-time lot-sizing problems arising both in the practice and in literature. To use BC-PROD, the user needs to formulate his/her problem as a mixed integer program using XPRESS-MP's...