06119221

j

06119221 Nagano, Kiyohito Aihara, Kazuyuki Equivalence of convex minimization problems over base polytopes. Japan J. Ind. Appl. Math. 29, No. 3, 519-534 (2012). 2012 Springer, Tokyo EN convex optimization submodular function combinatorial optimization

doi:10.1007/s13160-012-0083-z

Summary: This paper considers convex optimization problems over base polytopes of polymatroids. We show that the decomposition algorithm for the separable convex function minimization problems helps us derive simple sufficient conditions for the rationality of optimal solutions, and leads us to some useful properties, including the equivalence of the lexicographically optimal base problem, introduced by Fujishige, and the submodular utility allocation market problem, introduced by Jain and Vazirani. In addition, we deal with a class of non-separable convex objective functions. Moreover, we describe an algorithm for the lexicographically optimal base problem, which is a variant of the Fujishige-Wolfe algorithm.