...
首页> 外文期刊>Fuzzy sets and systems >Optimization of fuzzy relation equations with max-product composition
【24h】

Optimization of fuzzy relation equations with max-product composition

机译:乘积最大的模糊关系方程的优化

获取原文
获取原文并翻译 | 示例
           

摘要

An optimization problem with a linear objective function subject to a system of fuzzy relation equations using max- product composition is considered. Since the feasible domain is non-convex, traditional linear programming methods cannot be applied. We study this problem and capture dome special characteristics of its feasible domain and the optimal solutions. Some procedures for reducing the original problem are presented. The problem is transformed into a 0-1 integer program Which is then solved by the branch-and -bound method. For illustration purpose, an example of the procedures is provided.
机译:考虑具有线性目标函数的优化问题,该线性目标函数服从使用最大积构成的模糊关系方程组。由于可行域是非凸的,因此无法应用传统的线性规划方法。我们研究了这个问题,并捕获了其可行域的圆顶特征和最佳解决方案。介绍了一些减少原始问题的过程。该问题被转换为0-1整数程序,然后通过分支定界方法解决。为了说明的目的,提供了过程的示例。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号