This paper introduces $\Delta$-MILP, a powerful variant of the mixed-integer linear programming (MILP) optimization framework to solve NASA's Deep Space Network (DSN) scheduling problem. work is an extension our original MILP (DOI:10.1109/ACCESS.2021.3064928) and inherits many its constructions strengths, including base formulation for DSN scheduling. To provide more feasible schedules with res...

Abstract We study linear bilevel programming problems, where (some of) the leader and follower variables are restricted to be integer. A discussion on relationships between optimistic pessimistic setting is presented, providing necessary sufficient conditions for them equivalent. new class of inequalities, optimality cuts, introduced. They used derive a single-level non-compact reformulation pr...

closed-loop supply chain network design is a critical issue due to its impact on both economic and environmental performances of the supply chain. in this paper, we address the problem of designing a multi-echelon, multi-product and capacitated closed-loop supply chain network. first, a mixed-integer linear programming formulation is developed to maximize the total profit. the main contribution...

despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. this paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (mip) models to solve thisproblem. these models have been formulated for the classical single machine problem, namely sequ...

Data Envelopment Analysis (DEA) cannot provide adequate discrimination among efficient decision making units (DMUs). To discriminate these efficient DMUs is an interesting research subject. The purpose of this paper is to develop the mix integer linear model which was proposed by Foroughi (Foroughi A.A. A new mixed integer linear model for selecting the best decision making units in data envelo...