## Methods of optimization |

### From inside the book

28 pages matching **linear programming problem** in this book

Where's the rest of this book?

Results 1-3 of 28

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Introduction | 1 |

Nonlinear Programming | 35 |

Search Methods for Unconstrained Optimization | 74 |

Copyright | |

5 other sections not shown

### Common terms and phrases

assumed classical optimization complementary DFP concave function constrained local maximum constraint boundary constraint qualification convergence convex function convex set current point defined derivatives DFP method direction of search dynamic programming equality constraints equation evaluations Example f(xk function value given global maximum Golden Section search gradient methods Hence Hessian matrix inequality constraints initial point interval of uncertainty iteration Kuhn-Tucker necessary conditions Lagrange multipliers Lagrangian function linear programming linear programming problem linear searches maximum of f(x maximum value minimal path minimizes f(x minimizing problem minimum mutually conjugate directions node non-negativity restrictions nonlinear programming nonlinear programming problem objective function obtain optimal point optimal solution optimization problem optimization technique point x1 positive definite Powell's method problem 2.1 proof quadratic function quadratic programming problem replaced saddle-point satisfies the constraints search direction Section sequence solve step lengths Suppose surplus variables Theorem unconstrained optimization unrestricted in sign vector x'Dx