排序方式： 共有1条查询结果，搜索用时 31 毫秒
1
1.
In this paper,a discussion on the new polynomial-time algorithm for linearprogramming as proposed by Karmarkar.N.is presented.The problem is solved when aninitial feasible solution is unknown.For the case where the optimum value of the objectivefunction is unknown,the reasonableness and feasibility of the sliding objective functionmethod are proved.And a method of modifying the parameters is put forward. 相似文献
1