Optimal design of a membrane separation process using signomial programming

A multistage membrane separation process for hydrogen recovery is described and formulated as a signomial programming problem. Two different configurations are examined. A 3-stage and a 5-stage process design problem are solved. The optimal solution to these programs is computed from an initial point that does not satisfy the mass balance or transport constraints of the process, using a primal-based geometric programming code. Also examined is the sensitivity of the optimal solution to changes in purity requirements. In all cases, computation times are very reasonable ranging from 2 to 4 seconds of IBM 370/165 CPU time.     

A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory

We present a greedy algorithm for solving a special class of convex programming problems and establish a connection with polymatroid theory which yields a theoretical explanation and verification of the algorithm via some recent results of S. Fujishige.     

关于FLP问题一种新的单纯形算法的推广

指出FLP问题的一种新的单纯形算法[1]中主要结论成立的适用条件,并给出了该适用条件不成立时,一般条件下的推广.     

Goal programming approaches for data envelopment analysis cross efficiency evaluation

Cross efficiency evaluation has long been proposed as an alternative method for ranking the decision making units (DMUs) in data envelopment analysis (DEA). This study proposes goal programming models that could be used in the second stage of the cross evaluation. Proposed goal programming models have different efficiency concepts as classical DEA, minmax and minsum efficiency criteria. Numerical examples are provided to illustrate the applications of the proposed goal programming cross efficiency models.     

Optimal Channel Selection algorithm for CRahNs

As the data traffic is increasing, the spectrum bands are getting congested. It causes low latency and unreliable communication. Additional spectrum can be utilized to solve this problem but moving towards higher frequency means higher power requirement and increased cost. Cognitive radio network is another solution to this problem. It helps the nodes of a network to use the channels of the nearby bands which are not being used at that time. However, it has several challenges. One of these challenges is the transmission collision with the primary users of the network. Researchers have been working on this problem. However, it is still a major concern for the researchers. This paper proposes an algorithm that selects the optimal cognitive channel for the data transmission by the secondary user in such a way so that the transmission collision with the PU is minimized. After comparison with the existing latest similar protocol, the proposed protocol has shown 5.6% improvement in the throughput, 5.3% improvement in PDR. The delay is decreased by 0.6% and the transmission collision with PUs is reduced by 2.5%.     

模糊关系几何规划

提出一类目标函数为正项式,约束是模糊关系方程的优化问题。阐述模糊关系方程解集的结构以及求解的方法,基于目标函数中每个单项式的指数取值情况讨论最优解,并且给出解决此类优化问题的一个程序,为了说明该方法的有效性给出具体例子。