This paper studies the computation of order up to levels for a stochastic programming inventory problem of a perishable product. Finding a solution is a challenge as the problem enhances a perishable product, fixed ordering cost and non-stationary stochastic demand with a service level constraint. An earlier study [6] derived order-up-to values via an MILP approximation. We consider a computati...

10 This paper addresses the optimal design and planning of sustainable chemical supply 11 chains (SCs) in the presence of uncertainty in the damage model used to evaluate 12 their environmental performance. The environmental damage is assessed through 13 the Eco-indicator 99, which includes recent advances made in Life Cycle Assess14 ment (LCA). The overall problem is formulated as a bi-criteri...

This paper addresses the common cycle multi-product lot-scheduling problem in flexible flow lines (FFL) where the product demands are deterministic and constant over a finite planning horizon. Objective is minimizing the sum of setup costs, work-in-process and final products inventory holding costs per time unite while satisfying the demands without backlogging. This problem consists of a combi...

Abstract Different versions of polyhedral outer approximation are used by many algorithms for mixed-integer nonlinear programming (MINLP). While it has been demonstrated that such methods work well convex MINLP, extending them to solve nonconvex problems traditionally challenging. The Supporting Hyperplane Optimization Toolkit (SHOT) is a solver based on approximations the feasible set MINLP pr...

in this paper a new method is proposed for path planning of planar manipulators amid obstacles through mathematical programming in a way that the robot’s links avoid collision with obstacles throughout their motion from an initial to a goal configuration. after inputting the workspace geometry, the shortest feasible path for the robot’s end-effector is planned toward its goal position using gen...