Loading…
Solving a Linear Programming with Fuzzy Constraint and Objective Coefficients
In this paper, we consider a method for solving a linear programming problem with fuzzy objective and coefficient matrix, where the fuzzy numbers are supposed to be triangular. By the proposed method, the Decision Maker will have the flexibility of choosing. The solving method is based on the Pareto...
Saved in:
Published in: | International journal of intelligent systems and applications 2016-07, Vol.8 (7), p.65-72 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | In this paper, we consider a method for solving a linear programming problem with fuzzy objective and coefficient matrix, where the fuzzy numbers are supposed to be triangular. By the proposed method, the Decision Maker will have the flexibility of choosing. The solving method is based on the Pareto algorithm, which converts the problem to a weighted-objective linear programming. For more illustration, after discussing the problem and the algorithm, we present an example, which its solutions are independent from the objective weights. |
---|---|
ISSN: | 2074-904X 2074-9058 |
DOI: | 10.5815/ijisa.2016.07.07 |