首页> 外文期刊>Mathematical Problems in Engineering: Theory, Methods and Applications >An Effective Computational Algorithm for the Global Solution of a Class of Linear Fractional Programming
【24h】

An Effective Computational Algorithm for the Global Solution of a Class of Linear Fractional Programming

机译:An Effective Computational Algorithm for the Global Solution of a Class of Linear Fractional Programming

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

摘要

For the minimization of the sum of linear fractions on polyhedra, it is likewise a class of linear fractional programming (LFP). In this paper, we mainly propose a new linear relaxation technique and combine the branch-and-bound algorithm framework to solve the LFP globally. It is worthwhile to mention that the branching operation of the algorithm occurs in the relatively small output space of the dimension rather than the space where the decision variable is located. When the number of linear fractions in the objective function is much lower than the dimension of the decision variable, the performance of the algorithm is better. After that, we also explain the effectiveness, feasibility, and other performances of the algorithm through numerical experiments.

著录项

  • 来源
  • 作者单位

    North Minzu Univ, Ningxia Prov Cooperat Innovat Ctr Sci Comp & Inte, Yinchuan 750021, Ningxia, Peoples R China|North Minzu Univ, Ningxia Prov Key Lab Intelligent Informat & Data, Yinchuan 750021, Ningxia, Peoples R China;

    Ningxia Univ, Sch Math & Stat, Yinchuan 750021, Ningxia, Peoples R China;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 英语
  • 中图分类
  • 关键词

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号