Strong Polynomiality of the Simplex Method

来源 :The 6th International Conference on Optimization and Control | 被引量 : 0次 | 上传用户:f520li
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  The simplex method for linear programming(LP)is not known to be a polynomial or strongly polynomial algorithm,even if an LP problem is non-degenerate and its coefficient matrix is totally unimodular.
其他文献
  In this paper,we consider a class of nonlinear time-delay optimal control problems with canonical equality and inequality constraints.
会议
  The traditional static relative robust shortest path(S-RSP)problem expresses great applications in transportation,construction and other route design proble
会议
  Consider images with Poisson noises,we propose a new denoising algorithm.Our approach is based on the weighted average of the observations in a neighbor-hoo
会议
  Providing high speed broadband services in the rural areas of Australia is a challenging task.One of the most used technique,Multiuser MIMO,is considered in
会议
  The global stock markets have experienced significant downturns over recent years.These crises play significant roles in the failure of the world economy.
会议
  We generalize the classical growth theory Solow model using parametric and global optimization models.
会议
  Most of the conventional computer models are based on the von Neumann computer architecture and the Turing machine model.
会议
  Clusterwise linear regression consists of finding a number of linear regression functions each approximating a subset of the data.
会议
  Real world practical scenarios are essentially input-output oriented problems.Often it is a difficult proposition as to how one should choose the inputs so
会议
  Based on Image Space Analysis,which is here briefly introduced,a new scalarization method for Vector Optimization Problems(VOP)is described.
会议