Global maximization of special classes of convex functions on a convex polyhedral set (Q1802610)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 205033
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Global maximization of special classes of convex functions on a convex polyhedral set |
scientific article; zbMATH DE number 205033 |
Statements
Global maximization of special classes of convex functions on a convex polyhedral set (English)
0 references
6 September 1993
0 references
Two global maximization problems on a convex polyhedral set are considered. The maximized function is the maximum of a family of linear functions. In the first problem this family is finite and in the second one it is continuous. The suggested algorithm for the first problem is based on the branch-and-bound method and for the second problem on the method of support problems. The results of an experimental comparison of the suggested methods with other known methods are given.
0 references
global maximization
0 references
family of linear functions
0 references
0.813310980796814
0 references
0.8049891591072083
0 references
