New Method to Posynomial Geometric Programming of Trapezoidal Fuzzy Numbers

2013 ◽  
Vol 5 (3) ◽  
pp. 373-380
Author(s):  
Zeinab Kheiri ◽  
Faezeh Zahmatkesh ◽  
Bing-Yuan Cao
Author(s):  
Nirbhay Mathur ◽  
Pankaj Kumar Srivastava ◽  
Ajit Paul

The main aim of this paper is to develop an approach based on trapezoidal fuzzy numbers to optimize transportation problem in fuzzy environment. The present algorithm has representation of availability, demand and transportation cost as trapezoidal fuzzy numbers. This algorithm is found quicker in terms of runtime as comparison to fuzzy VAM discussed in [Kaur A., Kumar A., A new method for solving fuzzy transportation problem using ranking function, Appl. Math. Model. 35:5652–5661, 2011; Ismail Mohideen S., Senthil Kumar P., A comparative study on transportation problem in fuzzy environment, Int. J. Math. Res. 2:151–158, 2010]. On the other hand this technique gives much better results than some classical methods like north-west corner and least cost method. Another benefit of this algorithm is that for certain transportation problems it directly gives optimal solution. It is one of the simplest methods to apply and perceive. Practical usefulness of the new method over other existing methods is demonstrated with two numerical examples.


Mathematics ◽  
2019 ◽  
Vol 7 (5) ◽  
pp. 464
Author(s):  
Armita Khorsandi ◽  
Bing-Yuan Cao ◽  
Hadi Nasseri

Geometric programming problems are well-known in mathematical modeling. They are broadly used in diverse practical fields that are contemplated through an appropriate methodology. In this paper, a multi-parametric vector α is proposed for approaching the highest decision maker satisfaction. Hitherto, the simple parameter α , which has a scalar role, has been considered in the problem. The parameter α is a vector whose range is within the region of the satisfaction area. Conventionally, it is assumed that the decision maker is sure about the parameters, but, in reality, it is mostly hesitant about them, so the parameters are presented in fuzzy numbers. In this method, the decision maker can attain different satisfaction levels in each constraint, and even full satisfaction can be reached in some constraints. The goal is to find the highest satisfaction degree to maintain an optimal solution. Moreover, the objective function is turned into a constraint, i.e., one more dimension is added to n-dimensional multi-parametric α . Thus, the fuzzy geometric programming problem under this multi-parametric vector α ∈ ( 0 , 1 ] n + 1 gives a maximum satisfaction level to the decision maker. A numerical example is presented to illustrate the proposed method and the superiority of this multi-parametric α over the simple one.


Author(s):  
Neha Bhatia ◽  
Amit Kumar

In previous studies, it is pointed out that in several situations it is better to use interval-valued fuzzy numbers insteadof triangular or trapezoidal fuzzy numbers. But till now, there is no method that deals with the sensitivity analysis ofsuch linear programming problems in which all the parameters are represented by interval-valued fuzzy numbers. Inthis paper, a new method is proposed for the sensitivity analysis. Finally, the proposed method is illustrated using anumerical example.


2014 ◽  
Vol 26 (1) ◽  
pp. 77-89 ◽  
Author(s):  
Nasser Shahsavari-Pour ◽  
Reza Tavakkoli-Moghaddam ◽  
Mohammad-Ali Basiri

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Sukhpreet Kaur Sidhu ◽  
Amit Kumar ◽  
S. S. Appadoo

The drawbacks of the existing methods to obtain the fuzzy optimal solution of such linear programming problems, in which coefficients of the constraints are represented by real numbers and all the other parameters as well as variables are represented by symmetric trapezoidal fuzzy numbers, are pointed out, and to resolve these drawbacks, a new method (named as Mehar method) is proposed for the same linear programming problems. Also, with the help of proposed Mehar method, a new method, much easy as compared to the existing methods, is proposed to deal with the sensitivity analysis of the same type of linear programming problems.


Sign in / Sign up

Export Citation Format

Share Document