...性规划; 最优解集;充分必要条件;时间复杂度;多项式时间算法 [gap=507]keywords:linear programming; optimal solution set; necessary and sufficient condition; time complexity; polynomial algorithm ..
基于44个网页-相关网页
The upper semiconvergence of optimal solution set of approximations for a class of probabilistic constrained programs;
模拟实验结果表明,改进后的计数算法能够找到所有的非劣最优解。
The operation not only helps to maintain uniformity of the Pareto optimal solution set, but enhances the algorithm's searching ability.
该操作不仅起到了维持非劣最优解集均匀性的作用,而且增强了算法的搜索功能。
This paper discussed almost everywhere upper semiconvergence of optimal solution set of empirical approximations for stochastic programs.
本文对随机规划经验逼近最优解集的几乎处处上半收敛性进行了研究。
应用推荐