Global minimization of a concave function subject to mixed linear and reverse convex constraints (Q913663): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:06, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Global minimization of a concave function subject to mixed linear and reverse convex constraints |
scientific article |
Statements
Global minimization of a concave function subject to mixed linear and reverse convex constraints (English)
0 references
1988
0 references
The paper is concerned with the global minimization of a concave function over a nonconvex set which is a kind of `excised' polyhedral convex set. This class of optimization problems is extensively analyzed. Basic properties of the problem are given, a general method for partitioning a polyhedral convex set into generalized simplices are proposed and it is shown how this partition can be incorporated into a branch-and-bound algorithm to solve this problem.
0 references
nonconvex domain
0 references
global minimization
0 references
concave function
0 references
polyhedral convex set
0 references
generalized simplices
0 references
branch-and-bound
0 references
