In this contribution we apply different approaches to solve four rather different MINLP problems: special extensions to time-indexed formulations of production planning problems, a production planning problem in BASF’s petrochemical division, a site analysis of one of BASF’s bigger sites, and a process design problem. The first problem is related to a useful nonlinear extension of production pl...

In this article, the design of a Supply Chain Network (SCN) consisting of several suppliers, production plants, distribution centers and retailers, is considered. Demands of retailers are considered stochastic parameters, so we generate amounts of data via simulation to extract a few demand scenarios. Then a mixed integer two-stage programming model is developed to optimize simultaneously two o...

We discuss two families of valid inequalities for linear mixed integer programming problems with cone constraints of arbitrary order, which arise in the context of stochastic optimization with downside risk measures. In particular, we extend the results of Atamtürk and Narayanan (Math. Program., 2010, 2011), who developed mixed integer rounding cuts and lifted cuts for mixed integer programming...

over the two last decades, distribution companies have been aware of the importance of paying attention to the all aspects of a distribution system simultaneously to be successful in the global market. these aspects are the economic, the environmental, the social and the safety aspects. in the vehicle routing problem (vrp) literature, the economic issue has often been used, while the environmen...

in some industries as foundries, it is not technically feasible to interrupt a processor between jobs. this restriction gives rise to a scheduling problem called no-idle scheduling. this paper deals with scheduling of no-idle open shops to minimize maximum completion time of jobs, called makespan. the problem is first mathematically formulated by three different mixed integer linear programming...

In this paper, a robust reconfiguration approach based on Mixed Integer Programming (MIP) is proposed to minimize loss in distribution systems. A Depth-First Search (DFS) algorithm to enumerate possible loops provides radiality constraint. This provides a general solution to the radiality constraint for distribution system reconfiguration/expansion problems. Still, imprecision and ambiguity in ...