Non-convex programming /
The paper is concerned with the solution of the problem, minimize f sub o(x, y), subject to the constraints, f sub i(x, y) = or <0, i = 1 ..., m, when the functions f sub i(x, y) are not necessarily convex in the variables x and y. In particular, it is assumed that we may write f sub i(x, y) = h...
| Main Authors: | , |
|---|---|
| Corporate Authors: | , |
| Format: | Book |
| Language: | English |
| Published: |
[College Station, Tex.] :
Institute of Statistics, Texas A & M University,
1968.
|
| Series: | Technical report (Texas A & M University. Themis Optimization Research Program) ;
no. 6. |
| Subjects: |
| Summary: | The paper is concerned with the solution of the problem, minimize f sub o(x, y), subject to the constraints, f sub i(x, y) = or <0, i = 1 ..., m, when the functions f sub i(x, y) are not necessarily convex in the variables x and y. In particular, it is assumed that we may write f sub i(x, y) = h sub i(x) - g sub i(y), i = 0 ..., m where the h sub i(x) are convex functions of the n-vector x but nothing is assumed about the functions g sub i(y) which depend on the N-vector y. Techniques are proposed for obtaining relative optima for the general problem and global optima for certain special cases. |
|---|---|
| Item Description: | "November 26, 1968." "Research conducted through the Texas A & M Research Foundation." |
| Physical Description: | 21 leaves, 6 unnumbered leaves ; 28 cm |