An Introduction to Optimization
Praise for the Third Edition ". . . guides and leads the reader through the learning path . . . [e]xamples are stated very clearly and the results are presented with attention to detail." —MAA Reviews
Fully updated to reflect new developments in the field, the Fourth Edition of Introduction to Optimization fills the need for accessible treatment of optimization theory and methods with an emphasis on engineering design. Basic definitions and notations are provided in addition to the related fundamental background for linear algebra, geometry, and calculus.
This new edition explores the essential topics of unconstrained optimization problems, linear programming problems, and nonlinear constrained optimization. The authors also present an optimization perspective on global search methods and include discussions on genetic algorithms, particle swarm optimization, and the simulated annealing algorithm. Featuring an elementary introduction to artificial neural networks, convex optimization, and multi-objective optimization, the Fourth Edition also offers:
What people are saying - Write a review
We haven't found any reviews in the usual places.
Global Search Algorithms
Introduction to Linear Programming
Problems with Equality Constraints
Integer Linear Programming
Problems with Inequality Constraints
Other editions - View all
augmented matrix basic feasible solution basis canonical augmented matrix chromosomes columns components compute Consider the problem constrained optimization convex function convex set corresponding denoted derivative dual duality eigenvalues equation Example Exercise exists feasible point feasible set Figure FONC formula function f genetic algorithm given global minimizer gradient algorithm Hence Hessian Hessian matrix inequality constraint input integer iteration Karmarkar’s KKT condition Lagrange condition least-squares Lemma linear programming problem LP problem MATLAB maximize multiobjective multiobjective optimization neural network neuron Newton’s method norm notation Note nullspace objective function objective function value obtain optimal solution optimization problem order of convergence orthogonal Pareto penalty function positive definite primal problem in standard problem minimize Proof pseudoinverse quadratic function rank satisfy secant method sequence Show simplex algorithm simplex method solve standard form steepest descent subspace Suppose symmetric tableau Theorem unconstrained update variables vector write