首页> 外文期刊>Journal of computational science >A fuzzy based branch and bound approach for multi-objective linear fractional (MOLF) optimization problems
【24h】

A fuzzy based branch and bound approach for multi-objective linear fractional (MOLF) optimization problems

机译:多目标线性分数(MOLF)优化问题的基于模糊分支定界方法

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

摘要

In the present study, a new fuzzy based branch-bound approach is attempted for solving multi-objective linear fractional (MOLF) optimization problems. The original MOLF optimization problem is converted into equivalent fuzzy multi-objective linear fractional (FMOLF) optimization problem. Then branch and bound techniques is applied on FMOLF optimization problem. The feasible space of FMOLF optimization problem is bounded by triangular simplex space. The weak duality theorem is used to generate the bound for each partition and feasibility conditions are applied to neglect one of the partition in each step. After finite number of steps, a fuzzy efficient (Pareto-optimal) solution is obtained for FMOLF optimization problem which is also efficient (Pareto-optimal) solution of the original MOLF optimization problem. Some theoretical validations are also established for the proposed approach on FMOLF optimization problem. For the efficiency of proposed approach, it has been performed on two numerical applications. The method is coded in Matlab (2016). The results are compared with earlier reported methods. (C) 2017 Elsevier B.V. All rights reserved.
机译:在当前的研究中,尝试一种新的基于模糊的分支约束方法来解决多目标线性分数(MOLF)优化问题。将原始的MOLF优化问题转换为等效的模糊多目标线性分数(FMOLF)优化问题。然后将分支定界技术应用于FMOLF优化问题。 FMOLF优化问题的可行空间以三角形单纯形空间为界。弱对偶定理用于为每个分区生成边界,并且在每个步骤中应用可行性条件来忽略该分区之一。经过有限的步骤后,获得了针对FMOLF优化问题的模糊有效(帕累托最优)解,这也是原始MOLF优化问题的有效(帕累托最优)解。还针对FMOLF优化问题的建议方法建立了一些理论验证。为了提高所提出方法的效率,已在两个数值应用程序上执行了该方法。该方法在Matlab(2016)中进行了编码。将结果与早期报道的方法进行比较。 (C)2017 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号