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...

Full description

Bibliographic Details

Main Authors:	Hartley, H. O. (Author), Hocking, R. R. (Ronald R.), 1932- (Author)
Corporate Authors:	Texas A & M Research Foundation, United States. Office of Naval Research (sponsoring body.)
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:	Nonconvex programming. Nonlinear programming. Mathematical optimization.