An incremental primal-dual method for generalized networks
โ Scribed by Norman D. Curet
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 816 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0305-0548
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper, we introduce the truncated primalinfeasible dual-feasible interior point algorithm for linear programming and describe an implementation of this algorithm for solving the minimum-cost network flow problem. In each iteration, the linear system that determines the search direction is co
This paper presents a method of sensitivity analysis on the cost coecients and the right-hand sides for most variants of the primalยฑdual interior point method. We ยฎrst deยฎne an e-optimal solution to describe the characteristics of the ยฎnal solution obtained by the primalยฑdual interior point method.