On a class of functions attaining their maximum at the vertices of a polyhedron (Q1115347): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q541992 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Nicolas Yanev / rank | |||
Normal rank | |||
Revision as of 02:00, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a class of functions attaining their maximum at the vertices of a polyhedron |
scientific article |
Statements
On a class of functions attaining their maximum at the vertices of a polyhedron (English)
0 references
1989
0 references
The well known result that a convex function attains its maximum at a vertex of a polytope is extended here in some sense to functions which are convex on the edges of a polyhedron, or are m-convex. As an application the polynomial time solvability of a special combinatorial problem is proved.
0 references
polynomial time solvability
0 references
