Supply Chain Management (SCM) decisions can be considered at different levels of detail. At a strategic level they apply to the architecture in the supply chain, at the tactical level to transport fleet selection, selection of supply sources and distribution, and at the operational level, to the distribution of supplies and route selection. Many models of decision-making SCM have been developed...

Design of a logistics network in proper way provides a proper platform for efficient and effective supply chain management. This paper studies a multi-period, multi echelon and multi-product integrated forward-reverse logistics network under uncertainty. First, an efficient complex mixed-integer linear programming (MILP) model by considering some real-world assumptions is developed for the inte...

We consider the share backup path protection (SBPP) and 1+1 protection techniques for CO-OFDM-based elastic optical networks. We develop mixed integer linear programming (MILP) models to minimize required protection capacity and used link spectrum in the network. OCIS codes: (060.4250) Networks; (060.4257) Networks, network survivability

Abstract In the current work, a new precedence-based mixed integer linear programming (MILP) scheduling framework, based on a continuous-time representation, is developed for the scheduling in multi-stage batch plants. Advantages and special features of the proposed scheduling model are highlighted through several instances of two base case studies. Results are analyzed and further criticized t...

This paper focuses on optimal path planning for vehicles in known environments. Previous work has presented mixed integer linear programming (MILP) formulations, which suffer from scalability issues as the number of obstacles, and hence the number of integer variables, increases. In order to address MILP scalability, a novel three-stage algorithm is presented which first computes a desirable pa...

One way to address multi-scale optimisation problems is by integrating logic and optimisation. For example, a scheduling problem may have two levels: (i) assigning orders to machines and (ii) sequencing orders on each machine. In a minumum cost model, assigning orders to machines is a mixed-integer optimisation problem, sequencing orders is a constraint satisfaction problem. The entire problem ...

This paper studies a scenario-based mean-CVaR portfolio optimization problem with nonconvex transaction costs. This problem can be framed as a mixed integer linear programming (MILP) problem by making a piecewise linear approximation of the transaction cost function. Nevertheless, large-scale problems are computationally intractable even with state-of-the-art MILP solvers. To efficiently solve ...

In this work a mixed integer linear programming (MILP) formulation for the design of a class of linear-phase FIR filters are presented. The formulation can be solved using general purpose MILP solvers to obtain filter implementation with a minimum number of signed-power-of-two (SPT) terms given a filter specification. The filter structures considered are based on reduced complexity polyphase de...