Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector

DOI10.1287/moor.5.2.186zbMath0442.90071MaRDI QIDQ3885530

Satoru Fujishige

Publication date: 1980

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.5.2.186

zbMATH Keywords

algorithm; sensitivity analysis; quadratic objective function; weight vector; lexicographically optimal flow; lexicographically optimal base of a polymatroid; network with multiple sources and sinks

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

65K05: Numerical mathematical programming methods

90C10: Integer programming

90B10: Deterministic network models in operations research

Related Items

Lexicographically Optimal Base of a Submodular System with respect to a Weight Vector, Principal structures of submodular systems, Two algorithms for maximizing a separable concave function over a polymatroid feasible region, Generalization of a theorem on the parametric maximum flow problem, Minimizing a submodular function arising from a concave function, How to compute least infeasible flows, Minimization of an M-convex function, A push-relabel framework for submodular function minimization and applications to parametric optimization, Coordinatewise domain scaling algorithm for M-convex function minimization, Towards equitable distribution via proportional equity constraints