Accession Number : AD0679618
Title : NON-CONVEX PROGRAMMING.
Descriptive Note : Themis optimization research program,
Corporate Author : TEXAS A AND M UNIV COLLEGE STATION INST OF STATISTICS
Personal Author(s) : Hartley,H. O. ; Hocking,R. R.
Report Date : 26 NOV 1968
Pagination or Media Count : 25
Abstract : 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. (Author)
Descriptors : (*NONLINEAR PROGRAMMING, PROBLEM SOLVING), OPTIMIZATION, ALGORITHMS
Subject Categories : Operations Research
Distribution Statement : APPROVED FOR PUBLIC RELEASE