Letter to the Editor—Extensions of the Augmented Predecessor Index Method to Generalized Network Problems

Abstract

The augmented predecessor indexing method is a procedure for efficiently updating the basis representation, flows, and node potentials in an adjacent extreme point (or “simplex” type) method for network problems, utilizing ideas due to Ellis Johnson in his proposed application of a triple-label representation to networks. The procedure is extended here to accommodate the more complex basis structures and updating processes of the generalized network problem, specifying rules for expediting the calculations.