首页> 外文期刊>Applied mathematics and computation >Solving a linear programming problem with the convex combination of the max-min and the max-average fuzzy relation equations
【24h】

Solving a linear programming problem with the convex combination of the max-min and the max-average fuzzy relation equations

机译:用最大-最小和最大-平均模糊关系方程的凸组合解决线性规划问题

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

摘要

In this paper, we introduce a fuzzy operator constructed by the convex combination of two known operators, max-min and max-average compositions [H.J. Zimmermann, Fuzzy set theory and it's application, Kluwer Academic Publishers, Boston, Dordrecht, London, 1999]. This operator contains some properties of the two known compositions when it generates the feasible region for linear optimization problems. We investigate linear optimization problems whose feasible region is the fuzzy sets defined with this operator. Thus, firstly, the structure of these fuzzy regions is considered and then a method to solve the linear optimization problems with fuzzy equation constraints regarding this operator is presented. (c) 2006 Elsevier Inc. All rights reserved.
机译:在本文中,我们介绍了一个模糊算子,它由两个已知算子(最大-最小和最大-平均组成)的凸组合构成。 Zimmermann,模糊集理论及其应用,Kluwer学术出版社,波士顿,多德雷赫特,伦敦,1999年]。当该算子为线性优化问题生成可行区域时,它包含两个已知合成的某些属性。我们研究线性优化问题,该问题的可行区域是用该算子定义的模糊集。因此,首先考虑了这些模糊区域的结构,然后提出了一种解决带有该算子的模糊方程约束的线性优化问题的方法。 (c)2006 Elsevier Inc.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号