this research provides an optimization tool for use by supply chain managers in the design and operation of manufacturing- distribution networks under uncertain demand conditions. the problem under consideration consists of determining the supply chain infrastructure; raw material purchases, shipments, and inventories; and finished product production quantities, inventories, and shipments neede...

This paper studies disjunctive cutting planes in Mixed-Integer Conic Programming. Building on conic duality, we formulate a cut-generating program for separating cuts, and investigate the impact of normalization condition its resolution. In particular, show that careful selection guarantees solvability strong duality. Then, highlight shortcomings conic-infeasible points an outer-approximation c...

Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...