s-The Cyclotomic Polynomial (CP) prefilter design problem is formulated as an optimization problem with linear objective functions by applying the logarithm to the transfer function of the CP prefilter. Then this problem is solved by mixed integer linear programming (MILP). Design examples demonstrate that this method leads to more efficient cascaded FIR prefilter-equalizers than existing methods.

today, due to the direct and reverse logistics plays an important role in reducing the costs in supply chain. in this paper, in order to provide a closed-loop supply chain network including supply centers, production, distribution, collection, recycling and disposal of a used linear mixed integer programming. this paper to consider multi-period and multi-product in multi-level supply chain and ...

proposing a robust designed facility location is one of the most effective ways to hedge against unexpected disruptions and failures in a transportation network system. this paper considers the combined facility location/network design problem with regard to transportation link disruptions and develops a mixed integer linear programming formulation to model it. with respect to the probability o...

We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and scheduled using CP, and the two are linked via logic-based Benders decomposition. Tasks assigned to a facility may run in parallel subject to resource constraints (cumulative scheduling). We solve minimum cost problems, as...

integrated production-distribution planning (pdp) is one of the most important approaches in supply chain networks. we consider a supply chain network (scn) to consist of multi suppliers, plants, distribution centers (dcs), and retailers. a bi-objective mixed integer linear programming model for integrating production-distribution designed here aim to simultaneously minimize total net costs in ...

In this paper we investigate Multi-Objective Integer Linear Programming (MOILP) problems with unbounded feasible region and introduce recession direction for MOILP problems. Then we present necessary and sufficient conditions to have unbounded feasible region and infinite optimal values for objective functions of MOILP problems. Finally we present some examples with unbounded feasible region and fi...

Answer set programming is a programming paradigm where a given problem is formalized as a logic program whose answer sets correspond to the solutions to the problem. In this paper, we link answer set programming with another widely applied paradigm, viz. mixed integer programming. As a theoretical result, we establish translations from non-disjunctive logic programs to linear constraints used i...

This paper presents a new formulation of multi-instance learning as maximum margin problem, which is an extension of the standard C-support vector classification. For linear classification, this extension leads to, instead of a mixed integer quadratic programming, a continuous optimization problem, where the objective function is convex quadratic and the constraints are either linear or bilinea...