z-logo
open-access-imgOpen Access
Convexity and Steinitz's exchange property
Author(s) -
Kazuo Murota
Publication year - 1996
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
DOI - 10.1007/3-540-61310-2_20
Subject(s) - matroid , submodular set function , combinatorics , concave function , mathematics , convexity , weighted matroid , polytope , separable space , discrete mathematics , quasiconvex function , convex analysis , regular polygon , convex optimization , graphic matroid , mathematical analysis , matroid partitioning , geometry , financial economics , economics
A theory of “convex analysis” is developed for functions defined on integer lattice points. We investigate the class of functions which enjoy a variant of Steinitz's exchange property. It includes linear functions on matroids, valuations on matroids, and separable concave functions on the integral base polytope. It is shown that a function ω has the exchange property if and only if it can be extended to a concave function \(\bar \omega\)such that the maximizers of (\(\bar \omega\)+any linear function) form an integral base polytope. A Fenchel-type min-max theorem and discrete separation theorems are given, which contain, e.g., Frank's discrete separation theorem for submodular functions, and also Frank's weight splitting theorem for weighted matroid intersection.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom