Extremal problems with d.c.-contraints. (Q1395156)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Extremal problems with d.c.-contraints. |
scientific article; zbMATH DE number 1940566
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extremal problems with d.c.-contraints. |
scientific article; zbMATH DE number 1940566 |
Statements
Extremal problems with d.c.-contraints. (English)
0 references
29 June 2003
0 references
The paper is centred on nonconvex mathematical programming problems in which one of the inequality constraints is given by a difference of two convex functions (i.e., by a d.c.-function). Necessary and sufficient conditions for a global solution are obtained. In addition, these conditions possess the so-called algorithmic property, which allows the construction of computational method for finding a global solution in problems with d.c.-constraints.
0 references
nonconvex mathematical programming problem
0 references
d.c.-function
0 references
necessary and sufficient conditions
0 references
global optimum
0 references
constraints
0 references
