The Experts below are selected from a list of 270 Experts worldwide ranked by ideXlab platform
Syming Guu - One of the best experts on this subject based on the ideXlab platform.
-
a single Variable method for solving min max programming Problem with addition min fuzzy relational inequalities
Fuzzy Optimization and Decision Making, 2019Co-Authors: Yaling Chiu, Syming GuuAbstract:In this paper, we study the min–max programming Problem with n addition-min fuzzy relational inequality constraints. We prove that when the Problem is feasible, an optimal solution always exists with all Variables being of the same value. Based on this result, the min–max programming Problem can be simplified as a single-Variable Optimization Problem with the same optimal objective value. To solve the corresponding single-Variable Optimization Problem, we propose an analytical method and an iterative method by successively approximating the lower bound of the optimal value. Numerical examples are given to illustrate our methods.
-
A single-Variable method for solving min–max programming Problem with addition-min fuzzy relational inequalities
Fuzzy Optimization and Decision Making, 2019Co-Authors: Yaling Chiu, Syming GuuAbstract:In this paper, we study the min–max programming Problem with n addition-min fuzzy relational inequality constraints. We prove that when the Problem is feasible, an optimal solution always exists with all Variables being of the same value. Based on this result, the min–max programming Problem can be simplified as a single-Variable Optimization Problem with the same optimal objective value. To solve the corresponding single-Variable Optimization Problem, we propose an analytical method and an iterative method by successively approximating the lower bound of the optimal value. Numerical examples are given to illustrate our methods.
Yaling Chiu - One of the best experts on this subject based on the ideXlab platform.
-
a single Variable method for solving min max programming Problem with addition min fuzzy relational inequalities
Fuzzy Optimization and Decision Making, 2019Co-Authors: Yaling Chiu, Syming GuuAbstract:In this paper, we study the min–max programming Problem with n addition-min fuzzy relational inequality constraints. We prove that when the Problem is feasible, an optimal solution always exists with all Variables being of the same value. Based on this result, the min–max programming Problem can be simplified as a single-Variable Optimization Problem with the same optimal objective value. To solve the corresponding single-Variable Optimization Problem, we propose an analytical method and an iterative method by successively approximating the lower bound of the optimal value. Numerical examples are given to illustrate our methods.
-
A single-Variable method for solving min–max programming Problem with addition-min fuzzy relational inequalities
Fuzzy Optimization and Decision Making, 2019Co-Authors: Yaling Chiu, Syming GuuAbstract:In this paper, we study the min–max programming Problem with n addition-min fuzzy relational inequality constraints. We prove that when the Problem is feasible, an optimal solution always exists with all Variables being of the same value. Based on this result, the min–max programming Problem can be simplified as a single-Variable Optimization Problem with the same optimal objective value. To solve the corresponding single-Variable Optimization Problem, we propose an analytical method and an iterative method by successively approximating the lower bound of the optimal value. Numerical examples are given to illustrate our methods.
Yueming Cai - One of the best experts on this subject based on the ideXlab platform.
-
Secure Transmission for MISOME Wiretap Channels With Finite Alphabet Inputs
IEEE Wireless Communications Letters, 2018Co-Authors: Kuo Cao, Yueming Cai, Weiwei YangAbstract:This letter investigates secure transmission design for multiple-input single-output multi-antenna eavesdropper wiretap channels with finite alphabet inputs. With statistical channel state information of the eavesdropper’s channel at the transmitter, we utilize an approximated ergodic secrecy rate to reduce the computational complexity. Then we study joint Optimization of beamforming design and power control for maximizing the approximated ergodic secrecy rate. We transform the original multi-Variable Optimization Problem into a single-Variable Optimization Problem, which can be solved by 1-D Optimization techniques. Numerical examples show that the proposed scheme is superior to the conventional schemes.
-
A cooperative communication scheme based on coalition formation game in clustered wireless sensor networks
IEEE Transactions on Wireless Communications, 2012Co-Authors: Dan Wu, Yueming Cai, Liang Zhou, Jinlong WangAbstract:In this work, we study the Problem of how to strike a balance between the QoS provisioning and the energy efficiency when a cooperative communication scheme is applied to a clustered wireless sensor network. Specifically, we first characterize the tradeoff by a multi-Variable Optimization Problem, with the goal of balancing the outage performance and the network lifetime. Then, we horizontally decompose the Problem into the concatenation of two subProblems: i) the long-haul transmit power per sensor node, and ii) the set of assisting cluster nodes. For the former one, an optimal long-haul transmit power solution is proposed based on the Lambert W function. The latter one is modeled as a coalition formation game, where the characteristic function is designed based on the combination of the former subProblem's results. Furthermore, an optimal algorithm is proposed by using a dynamic coalition formation process based on the best-reply process with trial opportunity. Extensive simulation results are presented to demonstrate the effectiveness of our proposed scheme.
-
GLOBECOM - A Cooperative Communication Scheme Based on Dynamic Coalition Formation Game in Clustered Wireless Sensor Networks
2011 IEEE Global Telecommunications Conference - GLOBECOM 2011, 2011Co-Authors: Yueming CaiAbstract:In this paper, we focus on the Problem of how to strike a balance between the QoS provisioning and the energy consumption when a cooperative communication scheme is applied in a clustered wireless sensor network. We characterize this tradeoff by a multi-Variable Optimization Problem, with the goals of jointly maximizing the outage performance and the network lifetime. Then, we horizontally decompose the Problem into the concatenation of two subProblems: (i) the long-haul transmit power per sensor node, and (ii) the set of assisting cluster nodes (CNs). For the former one, the optimal long-haul transmit power solution is presented based on the Lambert W function, only with the knowledge of statistic channel state information. Moreover, a dynamic coalition formation game theoretical framework is modeled to solve the latter one. A corresponding algorithm is proposed by using a dynamic coalition formation process based on the best-reply process with trial opportunity. Through this algorithm, a stable coalition structure with a core allocation can be obtained, which can show the optimal set of assisting CNs. Extensive simulation results are provided to demonstrate the effectiveness of our proposed scheme.
Rahman Ahmad - One of the best experts on this subject based on the ideXlab platform.
-
A Generalized Algebraic Model for Optimizing Inventory Decisions in a Multi-Stage Complex Supply Chain
Transportation Research Part E: Logistics and Transportation Review, 2009Co-Authors: Mohamed E. Seliaman, Rahman AhmadAbstract:Abstract In this paper, we deal with more generalized inventory coordination mechanism in an n-stage, multi-customer, non-serial supply chain, where we extend and generalize pervious works that use algebraic methods to optimize this coordinated supply chain. We establish the recursive expressions for this multi-Variable Optimization Problem. These expressions are used for the derivation of the optimal replenishment policy and the development of the solution algorithm. Further, we describe a simple procedure that can help in sharing the coordination cost benefits to induce all stages to adopt the inventory coordination mechanism. We provide a numerical example for illustrative purposes.
Ibrahim Deiab - One of the best experts on this subject based on the ideXlab platform.
-
Concurrent Optimization of manufacturing cycle cost by genetic algorithms
Proceedings of the Institution of Mechanical Engineers Part B: Journal of Engineering Manufacture, 2007Co-Authors: Ibrahim Deiab, M.d. Al-ansaryAbstract:AbstractA systematic multi-phase procedure is developed concurrently to optimize the design and manufacturing parameters using the genetic algorithm (GA) method. The simultaneous consideration of both design and manufacturing decision Variables overcomes the conflicting relationship between these Variables and ensures global optimal design solution. A multi-Variable Optimization Problem for the optimum design of a robot arm is formulated and solved using the GA method to demonstrate the proposed procedure. The objective is to optimize (minimize) the total manufacturing cost under dimensional, weight, and machine power constraints using GA. Finite element analysis was adopted for the structural part of the analysis.
-
Concurrent Optimization of design and machining tolerances using the genetic algorithms method
International Journal of Machine Tools and Manufacture, 1997Co-Authors: M.d. Al-ansary, Ibrahim DeiabAbstract:The allocation of design and machining tolerances has a significant effect on both manufacturing cost and quality. This paper presents a procedure to concurrently allocate both design and machining tolerances based on optimum total machining cost. The non-linear multi-Variable Optimization Problem formulated is solved using the genetic algorithms method. Two design examples involving concurrent allocation of both design and machining tolerances are presented to demonstrate the effectiveness of the method.
