Local minima, marginal functions, and separating hyperplanes in discrete optimization. (Minima locaux, fonctions marginales et hyperplans séparants dans l’optimisation discrète.) (French) Zbl 1354.90074
Summary: The goal of this note is to prove results in optimization of two integer variables which correspond to fundamental results in convex analysis of real variables, viz. that a local minimum of a convex function is global; that the marginal function of a convex function is convex; and that two disjoint convex sets can be separated by a hyperplane.
References:
| [1] | Choquet, G., Theory of capacities, Ann. Inst. Fourier (Grenoble), 5, 131-295 (1953/1954), (1995) · Zbl 0064.35101 |
| [2] | Lovász, L., Submodular functions and convexity, (Bachem, A.; Grötschel, M.; Korte, B., Mathematical Programming—The State of the Art (1983), Springer-Verlag: Springer-Verlag Berlin), 235-257 · Zbl 0566.90060 |
| [3] | Murota, K., Discrete Convex Analysis (2003), Society for Industrial and Applied Mathematics: Society for Industrial and Applied Mathematics Philadelphia · Zbl 1029.90055 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
