首页> 外文会议>International conference on optimization: Techniques and Applications >A Linear Relaxation Algorithm for Solving the Sum of Linear Ratios Problem with Lower Dimension
【24h】

A Linear Relaxation Algorithm for Solving the Sum of Linear Ratios Problem with Lower Dimension

机译:一种线性松弛算法,用于解决较低尺寸的线性比率问题

获取原文

摘要

In this talk, we will present an algorithm for solving the sum-of-linear-ratios problem based on a linear relaxation of the objective function. When the number of ratios becomes large, the existing algorithms are unable to solve the problem efficiently. We focus on the problem with Lower Dimension. Our numerical experiments indicate that the proposed algorithm in this talk is superior to these existing algorithms when the number of ratios is large.
机译:在该谈话中,我们将基于目标函数的线性松弛来介绍一种解决线性比率问题的算法。当比率的数量变大时,现有算法无法有效地解决问题。我们专注于较低维度的问题。我们的数值实验表明,当比率数量大时,该谈判中所提出的算法优于这些现有算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号