共查询到2条相似文献,搜索用时 0 毫秒
1.
David C. Dellinger 《海军后勤学研究》1971,18(3):357-378
A linear programming application for the selection of aircraft for a tactical airlift fleet is described. 相似文献
2.
This article is concerned with the scaling variant of Karmarkar's algorithm for linear programming problems. Several researchers have presented convergence analyses for this algorithm under various nondegeneracy types of assumptions, or under assumptions regarding the nature of the sequence of iterates generated by the algorithm. By employing a slight perturbation of the algorithm, which is computationally imperceptible, we are able to prove without using any special assumptions that the algorithm converges finitely to an ε-optimal solution for any chosen ε > 0, from which it can be (polynomically) rounded to an optimum, for ε > 0 small enough. The logarithmic barrier function is used as a construct for this analysis. A rounding scheme which produces an optimal extreme point solution is also suggested. Besides the non-negatively constrained case, we also present a convergence analysis for the case of bounded variables. An application in statistics to the L1 estimation problem and related computational results are presented. 相似文献