.png){kind=icon}
Return
Solving linear optimization problems with max-star composition equation constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2005.12.006.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper an optimization model with a linear objective function subject to a system of fuzzy relation composition equations is presented. Since the non-empty feasible solution set of the fuzzy relation equations is generally a non-convex set, the conventional linear programming method will not be suitable for solving such a problem. Therefore, an efficient solution procedure for such problems appears to be necessary. In this paper, firstly, we characterize the feasible solution set, and then introduce two efficient procedures for solving the problem. Finally, two concrete examples are included for more details. (c) 2005 Elsevier Inc. All rights reserved.
Keywords:
max-star composition equations
linear function optimization problem
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSave no more
no more