Optimization and DesignM. Avriel, M. J. Rijckaert, Douglass J. Wilde |
Contents
THE DIRECTORS WELCOME | 1 |
AN INTRODUCTION TO MATHEMATICAL PROGRAMMING | 7 |
MINIMIZATION WITHOUT CONSTRAINTS | 37 |
Copyright | |
17 other sections not shown
Common terms and phrases
algorithm approach approximation Boolean coefficients column components computed conjugate transform consider constrained derivatives convergence convex functions convex program convex sets corresponding cost cycle defined denote design problems differentiable direction dual problem dual program duality Duffin dynamic programming engineering equations example family A1 feasible solution set Fiacco finite formulation geometric dual geometric programming given gradient heat exchange Hence Hessian matrix inequality constraints infimum integer programming interior-point iteration Lagrange multiplier Lagrangian linear program loop Math mathematical programming matrix maximizing methods minimum value Nonlinear Programming objective function obtained optimization problem optimum output parameter penalty function perturbation Peterson positive posynomial posynomial program primal procedure programming problem quadratic quadric satisfy sequence signomial solved stage step straints structure techniques temperature Theorem tion variables vector vertex Zener zero δν δυ