Solution of Fuzzy Multi-Objective Linear Programming Problems using Fuzzy Programming Techniques based on Exponential Membership Functions

2017 ◽  
Vol 41 (3) ◽  
pp. 289-292
Author(s):  
Priyadarsini Rath ◽  
Rajani B. Dash
Keyword(s):  
Linear Programming ◽  
Fuzzy Programming ◽  
Membership Functions ◽  
Multi Objective ◽  
Programming Techniques ◽  
Linear Programming Problems

scholarly journals Fuzzy Multi Objective Linear Programming Problem with Imprecise Aspiration Level and Parameters

2015 ◽  
Vol 5 (2) ◽  
pp. 81-86 ◽  
Author(s):  
Zahra Shahraki ◽  
Mehdi Allahdadi ◽  
Hassan Mishmast Nehi
Keyword(s):  
Linear Programming ◽  
Programming Problem ◽  
Linear Programming Problem ◽  
Aspiration Level ◽  
Membership Functions ◽  
Objective Functions ◽  
Multi Objective ◽  
Fuzzy Goals ◽  
Linear Programming Problems

This paper considers the multi-objective linear programming problems with fuzzygoal for each of the objective functions and constraints. Most existing works deal withlinear membership functions for fuzzy goals. In this paper, exponential membershipfunction is used.

LINEAR COORDINATION METHOD FOR FUZZY MULTI-OBJECTIVE LINEAR PROGRAMMING PROBLEMS WITH CONVEX POLYHEDRAL MEMBERSHIP FUNCTIONS

2004 ◽  
Vol 12 (03) ◽  
pp. 269-285 ◽  
Author(s):  
BUSABA PHRUKSAPHANRAT ◽  
ARIO OHSATO
Keyword(s):  
Linear Programming ◽  
Decision Maker ◽  
Convex Cone ◽  
Optimal Solution ◽  
Membership Functions ◽  
Convex Polyhedral ◽  
Multi Objective ◽  
Proposed Model ◽  
Optimal Solution Set ◽  
Linear Programming Problems

A fuzzy multi-objective decision-making with nonlinear membership functions is proposed in this paper by assuming that the decision maker has a fuzzy goal for each objective function. The fuzzy goals can be quantified by convex polyhedral membership functions, which are expressed by linguistic terms. The concept of the convex cone is used to formulate a normalized convex polyhedral penalty function, which can also be considered conversely as a convex polyhedral membership function. The most desirable value of membership functions are selected to be reference membership values of achievement of convex polyhedral membership functions that can be viewed as the extension of the idea of reference point method. The formulated model can be solved by existing linear programming solvers and can find the satisficing solution for the decision maker, which can be derived efficiently from among an M-Pareto optimal solution set together with the trade-off rates between the membership functions. The proposed model uses convex polyhedral membership functions to represent vague aspirations of the decision maker. It enriches the existing satisficing methods for fuzzy multi-objective linear programming in a more practical way with the effective method based on convex cone.

Solving Fully Fuzzy Multi-Objective Linear Programming Problems

2012 ◽  
Vol 3 (4) ◽  
pp. 1-6 ◽  
Author(s):  
M.Jayalakshmi M.Jayalakshmi ◽  
◽  
P.Pandian P.Pandian
Keyword(s):  
Linear Programming ◽  
Multi Objective ◽  
Linear Programming Problems
Sign in / Sign up

Export Citation Format

Share Document