Abstract There are more problems of network data transmission in multi-loop NCS than in single loop NCS. It maybe lead to that one or more of closed-loop systems become unstable in multi-loop NCS. In order to solve this problem, a novel algorithm of fuzzy dynamic scheduling for multi-loop NCS is put forward in this paper. Firstly, the requirement of the sampling period of NCS is discussed. The ...

This paper proposes a new algorithm for the solution of fully fuzzy Multi objective linear programming problems involving triangular fuzzy number without converting them to equivalent classical problems. Based on the fuzzy ideal and fuzzy negative ideal solution of each single fuzzy objective function we propose an algorithm which provides a fuzzy Pareto-optimal solution for the given fully fuz...

Designing a logistic network is a strategic and critical problem that provides an optimal platform for the effective and efficient supply chain management. In this research, we address the application of fuzzy sets to design a multi-product, multi-period, closed-loop supply chain network. The presented supply chain includes three objective functions: maximization of profit, minimization of deli...

In this paper, single and multi container maintenance model under limited time interval of interest is introduced in fuzzy environment. These fuzzy models are solved by fuzzy geometric programming technique. Here fuzzy geometric programming is discussed through fuzzy decision-making processes with three different operators, max-min, max-average mean, and max-geometric mean. These operators are ...

In this paper, we study the robustness over the cardinality variation for the knapsack problem. For the knapsack problem and a positive number α ≤ 1, we say that a feasible solution is α-robust if, for any positive integer k, it includes an α-approximation of the maximum k-knapsack solution, where a k-knapsack solution is a feasible solution that consists of at most k items. In this paper, we s...

The facet of Knapsack ploytope, i.e. convex hull of 0-1 points satisfying a given linear inequality has been presented in this current paper. Such type of facets plays an important role in set covering set partitioning, matroidal-intersection vertex- packing, generalized assignment and other combinatorial problems. Strong covers for facets of Knapsack ploytope has been developed in the first pa...