首页> 美国政府科技报告 >Proximate Linear Programming: An Experimental Study of a Modified Simplex Algorithm for Solving Linear Programs with Inexact Data
【24h】

Proximate Linear Programming: An Experimental Study of a Modified Simplex Algorithm for Solving Linear Programs with Inexact Data

机译:近似线性规划:一种改进的单纯形算法求解不精确数据线性规划的实验研究

获取原文

摘要

A modified simplex method has been developed for attacking large linear programs with inexact data in the right hand sides. Results from performing a limited series of computational experiments are reported. These results indicate reductions in computer time of 30 to 70 per cent over the ordinary simplex method. (Author)

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号