排序方式: 共有1条查询结果,搜索用时 0 毫秒
1
1.
This article is concerned with the minimization of the maximal value of a set of linear functions subject to linear constraints. It is well known that this problem can be transformed into a standard linear programming problem by introducing an additional variable. In case index sets of nonzero coefficients of the variables contained in each function are mutually exclusive, the constraints of the associated LP problem exhibit the almost-GUB structure. We devised a technique which reduces the number of arithmetic operations by exploiting this special structure. Computational results are also presented, which indicates that our method is more efficient than the ordinary revised simplex method. 相似文献
1