Optimal management model in BitTorrent-like peer-to-peer (P2P) file sharing system can be reduced into a min-max programming problem subject to addition-min fuzzy relation inequality. To deal with such problem, we int...
详细信息
Optimal management model in BitTorrent-like peer-to-peer (P2P) file sharing system can be reduced into a min-max programming problem subject to addition-min fuzzy relation inequality. To deal with such problem, we introduce the concept of optimal vector. Besides, a novel optimal-vector-based (OVB) algorithm is developed to find a minimal optimal solution. Based on practical application consideration, solution obtained by the OVB algorithm is theoretically demonstrated to be better than or equal to that obtained by the existing method. Advantage of our proposed OVB algorithm is illustrated by detailed numerical examples.
A BitTorrent-like peer-to-peer file-sharing system can be reduced into a system of addition-min fuzzy relation inequalities. Addition-min is a new composition, and the solution set of addition-min fuzzy relation inequ...
详细信息
A BitTorrent-like peer-to-peer file-sharing system can be reduced into a system of addition-min fuzzy relation inequalities. Addition-min is a new composition, and the solution set of addition-min fuzzy relation inequalities differs much from that of general max-t-norm fuzzy relation inequalities or equations. In order to avoid network congestion and improve the stability of data transmission, a min-max programming problem is proposed subject to addition-min fuzzy relation inequalities in this paper. Based on some relevant theorems on resolution, a novel algorithm is developed step by step to find an optimal solution of the proposed problem. Moreover, an application example is given to illustrate the feasibility and efficiency of the algorithm. Finally, some further discussions are made concerning the optimal solution of the proposed problem.
In this paper we introduce the latticized linear programming problem subject to max product fuzzy relation inequalities with application in the optimization management model of wireless communication emission base sta...
详细信息
In this paper we introduce the latticized linear programming problem subject to max product fuzzy relation inequalities with application in the optimization management model of wireless communication emission base stations. Resolution of max-product fuzzy relation inequalities is studied by comparing with that of the corresponding max-product fuzzy relation equations. A solution matrix approach is developed for solving the proposed problem without finding all the (quasi-) minimal solutions of the constraint. For carrying out the solution matrix approach, we provide a step-by-step algorithm illustrated by a numerical example. (C) 2016 Elsevier Inc. All rights reserved.
In this paper, a class of min-max continuous location problems is discussed. After giving a complete characterization of the stationary points, we propose a simple central and deep-cut ellipsoid algorithm to solve the...
详细信息
In this paper, a class of min-max continuous location problems is discussed. After giving a complete characterization of the stationary points, we propose a simple central and deep-cut ellipsoid algorithm to solve these problems for the quasiconvex case. Moreover, an elementary convergence proof of this algorithm and some computational results are presented.
minimization of the sum of a finite number of concave bottleneck functions subject to linear constraints is studied in the present paper. A related bottleneck linear programming problem which minimizes a single bottle...
详细信息
minimization of the sum of a finite number of concave bottleneck functions subject to linear constraints is studied in the present paper. A related bottleneck linear programming problem which minimizes a single bottleneck objective is constructed whose extreme point solutions provide bounds on the optimal value of the objective function of the problem under consideration. Some k(th) best solution (k greater-than-or-equal-to 1) of this bottleneck linear programming problem satisfying certain conditions is shown to provide an optimal feasible solution of the problem. The proposed algorithm obtains the global optimal solution of the main problem in a finite number of steps. A constrained version of this problem where the optimal feasible solution is required to satisfy an additional constraint is also discussed.
暂无评论