Auction algorithms for generalized nonlinear network flow problems

Thesis (Ph.D.)--Boston University PLEASE NOTE: Boston University Libraries did not receive an Authorization To Manage form for this thesis or dissertation. It is therefore not openly accessible, though it may be available by request. If you are the author or principal advisor of this work and would like to request open access for it, please contact us at open-help@bu.edu. Thank you.Network flow is an area of optimization theory concerned with optimization over networks with a range of applicability in fields such as computer networks, manufacturing, finance, scheduling and routing, telecommunications, and transportation. In both linear and nonlinear networks, a family of primal-dual algorithms based on "approximate" Complementary Slackness (ε-CS) is among the fastest in centralized and distributed environments. These include the auction algorithm for the linear assignment/transportation problems, ε-relaxation and Auction/Sequential Shortest Path (ASSP) for the min-cost flow and max-flow problems. Within this family, the auction algorithm is particularly fast, as it uses "second best" information, as compared to using the more generic ε-relaxation for linear assignment/transportation. Inspired by the success of auction algorithms, we extend them to two important classes of nonlinear network flow problems. We start with the nonlinear Resource Allocation Problem (RAP). This problem consists of optimally assigning N divisible resources to M competing missions/tasks each with its own utility function. This simple yet powerful framework has found applications in diverse fields such as finance, economics, logistics, sensor and wireless networks. RAP is an instance of generalized network (networks with arc gains) flow problem but it has significant special structure analogous to the assignment/transportation problem. We develop a class of auction algorithms for RAP: a finite-time auction algorithm for both synchronous and asynchronous environments followed by a combination of forward and reverse auction with ε-scaling to achieve pseudo polynomial complexity for any non-increasing generalized convex utilities including non-continuous and/ or non-differentiable functions. These techniques are then generalized to handle shipping costs on allocations. Lastly, we demonstrate how these techniques can be used for solving a dynamic RAP where nodes may appear or disappear over time. In later part of the thesis, we consider the convex nonlinear min-cost flow problem. Although E-relaxation and ASSP are among the fastest available techniques here, we illustrate how nonlinear costs, as opposed to linear, introduce a significant bottleneck on the progress that these algorithms make per iteration. We then extend the core idea of the auction algorithm, use of second best to make aggressive steps, to overcome this bottleneck and hence develop a faster version of ε-relaxation. This new algorithm shares the same theoretical complexity as the original but outperforms it in our numerical experiments based on random test problem suites