首页> 外文期刊>Journal of Advanced Manufacturing Technology >Augmentation of Simplex Algorithm for Linear Programming Problem to Enhance Computational Performance
【24h】

Augmentation of Simplex Algorithm for Linear Programming Problem to Enhance Computational Performance

机译:基于线性规划问题的简单X算法来增强计算性能的增强

获取原文
获取外文期刊封面目录资料

摘要

Linear programming (LP) has been seen as a tool to solve problem in mathematical way with various methods to perform the solution. Simplex method is one of pioneer methods in dealing with linear problem in LP. It involves step-by-step works towards the solution in its algorithm. Due to this distinctiveness, it has brought up interest in others and few studies were done by researchers to come out with augmentation study in enhancing computational performance of Simplex method in terms of initialization, iteration and termination. In this paper, three studies were recognized in augmenting Simplex algorithm namely Basic Line Search Algorithm (BLSA),.
机译:线性编程(LP)已被视为以数学方式解决问题的工具,以各种方法执行解决方案。 Simplex方法是在LP中处理线性问题的先驱方法之一。它涉及以算法对解决方案的逐步工作。由于这种独特性,它对他人带来了兴趣,研究人员在提高了在初始化,迭代和终止方面提高了Simplex方法的计算性能时,研究人员仍然存在兴趣。在本文中,在增强Simplex算法中识别出三项研究,即基本线路搜索算法(BLSA)。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号