Solving a Linear Programming Problem with The Convex Combination of the max-min And max-max fuzzy Relation Equations
Publish place: 2nd Joint Congress on Fuzzy and Intelligent Systems
Publish Year: 1387
Type: Conference paper
Language: English
View: 769
This Paper With 6 Page And PDF Format Ready To Download
- Certificate
- I'm the author of the paper
Export:
Document National Code:
FJCFIS02_117
Index date: 17 July 2013
Solving a Linear Programming Problem with The Convex Combination of the max-min And max-max fuzzy Relation Equations abstract
In this paper we have considered a linear programming problem with the convex combination of the max-min and the max-max fuzzy relation equations and determined thefeasible region for these constraints. We provide a necessary and sufficient condition for obtain the feasible region for this problem that it is normally non convex. Also we have presented a method to solve the linear optimization problem with this operator. At the end of the paper, a numerical example is given to illustrate the method
Solving a Linear Programming Problem with The Convex Combination of the max-min And max-max fuzzy Relation Equations Keywords:
Solving a Linear Programming Problem with The Convex Combination of the max-min And max-max fuzzy Relation Equations authors
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :