首页> 外文会议> >Optimizing the Linear Fractional Programming Problem with Max-Archimedean t-norm Fuzzy Relational Equation Constraints
【24h】

Optimizing the Linear Fractional Programming Problem with Max-Archimedean t-norm Fuzzy Relational Equation Constraints

机译:基于Max-Archimedean t-范数模糊关系方程约束的线性分数规划问题的优化

获取原文

摘要

In the literature, one of the minimal solutions is an optimal solution of solving a linear objective function subject to fuzzy relational equations with the max-Archimedean composition. Since the objective function is nonlinear so that this characteristic can''t be employed again to the optimization problem with a linear fractional objective function. In this paper, according to the characteristics of feasible domain of fuzzy relational equations with max-Archimedean t-norm composition, some theoretical results are presented for exploring such an optimization problem. These results can be employed to cut down the feasible domain first. Hence, the work of computing an optimal solution can be simplified. Then the simplified problem can be converted into traditional linear fractional programming problems and a simple procedure is proposed for optimizing such a problem.
机译:在文献中,最小的解决方案中的一个是用MAX-Archimedean组合物来解决受模糊关系方程的线性物镜函数的最佳解决方案。由于目标函数是非线性的,因此通过线性分数目标函数再次使用该特征来再次使用。本文根据具有MAX-ARCHIMEDEAN T-NARM组成的模糊关系方程的可行结构域的特性,提出了一些理论结果,用于探索这种优化问题。可以使用这些结果首先削减可行的域。因此,可以简化计算最佳解决方案的工作。然后,简化问题可以转换成传统的线性分数编程问题,提出了一种简单的过程来优化这种问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号