Integer and Nonlinear Programming

Front Cover
North-Holland Publishing Company, 1970 - Programming (Mathematics). - 544 pages
Convergence theory in nonlinear programming; Nonlinear programming, computational methods; Some practical methods of optimziation; Advanced algorithmic feature for general mathematical programming systems; Rank one methods for unconstrained optimization; A class of method for nonlinear programming with termination and convergence properties; Minimization of a convex function by relaxation; Application of the GRC algorithm to optimical control problems; Computational methods for least squares; Linear least squares and quadratic programming; Ritter's cutting plane method for nonconvex quadratic programming; Applications of nonlinear optimization to approximation problems; Nonlinear duality and qualitative properties of optimal growth; Stochastic programming; Nonlinear programming for models with joint chance constraints; Properties of a class of integer polyhedra; Faces of the gomory polyhedron.

From inside the book

Contents

Preface
1
necessary are ready to transform what has been mainly research into routine
2
J A Tomlin Branch and bound methods for integer and non
21
Copyright

23 other sections not shown

Common terms and phrases

Bibliographic information