首页> 外文会议>The 8th international conference on optimization: Techniques and Applications >A Bound for the Number of Different Basic Solutions Generated by the Simplex Method
【24h】

A Bound for the Number of Different Basic Solutions Generated by the Simplex Method

机译:单纯形法生成的不同基本解的数量的界

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

摘要

We give an upper bound for the number of different basic feasible solutions generated by the simplex method for a linear programming problem which has optimal solutions. The bound is polynomial of the number of constraints, the number of variables, and the ratio between the minimum and the maximum values of all the positive elements of primal basic feasible solutions.
机译:对于具有最优解的线性规划问题,我们给出了由单纯形法生成的不同基本可行解数目的上限。边界是约束数量,变量数量以及原始基本可行解的所有正元素的最小值与最大值之间的比率的多项式。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号