GOAL PROGRAMMING APPROACH TO CHANCE CONSTRAINED MULTI-OBJECTIVE LINEAR FRACTIONAL PROGRAMMING PROBLEM BASED ON TAYLOR’S SERIES APPROXIMATION
Journal: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY (Vol.2, No. 2)Publication Date: 2013-01-01
Authors : Durga Banerjee; Surapati Pramanik;
Page : 77-80
Keywords : Multi-objective linear fractional programming; Goal programming.;
Abstract
This paper deals with goal programming approach to chance constrained multi-objective linear fractional programming problem based on Taylor’s series approximation. We consider the constraints with right hand parameters as the random variables of known mean and variance. The random variables are transformed into standard normal variables with zero mean and unit variance. We convert the chance constraints with known confidence level into equivalent deterministic constraints. The goals of linear fractional objective functions are determined by optimizing it subject to the equivalent deterministic system constraints. Then the fractional objective functions are transformed into equivalent linear functions at the optimal solution point by using first order Taylor polynomial series. In the solution process, we use three minsum goal programming models and identify the most compromise optimal solution by using Euclidean distance function.
Other Latest Articles
- New Aggregation Operator for Triangular Fuzzy Numbers based on the Geometric Means of the Slopes of the L- and R- Membership Functions
- FOCUSED CRAWLING TECHNIQUES
- A DATA DISSEMINATION MODEL FOR VEHICULAR ADHOC NETWORK
- STUDY OF PARAMETERS FOR EVALUATION OF SOFTWARE AS A SERVICE
- Encrypted message transmission in a QO-STBC encoded MISO wireless Communication system under implementation of low complexity ML decoding algorithm
Last modified: 2016-06-30 14:24:05