000			09960cam a22003974a 4500
001			u8471
003			SA-PMU
005			20210418123547.0
008			050901s2006 njuab b 001 0 eng
010			_a 2005044611
040			_aDLC _beng _cDLC _dBAKER _dUKM _dC#P _dYUS _dCOO _dYDXCP _dBTCTA _dIG# _dDEBBG _dBDX _dHDC _dGBVCP _dOCLCF
020			_a0471558141 (cloth)
020			_a9780471558149
035			_a(OCoLC)61463772
042			_apcc
050	0	0	_aTA342 _b.R44 2006
082	0	0	_a620/.0042 _222
100	1		_aRavindran, A., _d1944-
245	1	0	_aEngineering optimization : _bmethods and applications / _cA. Ravindran, K.M. Ragsdell, G.V. Reklaitis.
250			_a2nd ed.
260			_aHoboken, N.J. : _bJohn Wiley & Sons, _cc2006.
300			_axv, 667 p. : _bill., map ; _c25 cm.
500			_aReklaitis' name appears first on the earlier edition.
504			_aIncludes bibliographical references and indexes.
505	0	0	_g1 _tIntroduction to Optimization _g1 -- _g1.1 _tRequirements for the Application of Optimization Methods _g2 -- _g1.1.1 _tDefining the System Boundaries _g2 -- _g1.1.2 _tPerformance Criterion _g3 -- _g1.1.3 _tIndependent Variables _g4 -- _g1.1.4 _tSystem Model _g5 -- _g1.2 _tApplications of Optimization in Engineering _g6 -- _g1.2.1 _tDesign Applications _g8 -- _g1.2.2 _tOperations and Planning Applications _g15 -- _g1.2.3 _tAnalysis and Data Reduction Applications _g20 -- _g1.2.4 _tClassical Mechanics Applications _g26 -- _g1.2.5 _tTaguchi System of Quality Engineering _g27 -- _g1.3 _tStructure of Optimization Problems _g28 -- _g2 _tFunctions of a Single Variable _g32 -- _g2.1 _tProperties of Single-Variable Functions _g32 -- _g2.2 _tOptimality Criteria _g35 -- _g2.3 _tRegion Elimination Methods _g45 -- _g2.3.1 _tBounding Phase _g46 -- _g2.3.2 _tInterval Refinement Phase _g48 -- _g2.3.3 _tComparison of Region Elimination Methods _g53 -- _g2.4 _tPolynomial Approximation or Point Estimation Methods _g55 -- _g2.4.1 _tQuadratic Estimation Methods _g56 -- _g2.4.2 _tSuccessive Quadratic Estimation Method _g58 -- _g2.5 _tMethods Requiring Derivatives _g61 -- _g2.5.1 _tNewton-Raphson Method _g61 -- _g2.5.2 _tBisection Method _g63 -- _g2.5.3 _tSecant Method _g64 -- _g2.5.4 _tCubic Search Method _g65 -- _g2.6 _tComparison of Methods _g69 -- _g3 _tFunctions of Several Variables _g78 -- _g3.1 _tOptimality Criteria _g80 -- _g3.2 _tDirect-Search Methods _g84 -- _g3.2.1 _tThe S[superscript 2] (Simplex Search) Method _g86 -- _g3.2.2 _tHooke-Jeeves Pattern Search Method _g92 -- _g3.2.3 _tPowell's Conjugate Direction Method _g97 -- _g3.3 _tGradient-Based Methods _g108 -- _g3.3.1 _tCauchy's Method _g109 -- _g3.3.2 _tNewton's Method _g111 -- _g3.3.3 _tModified Newton's Method _g115 -- _g3.3.4 _tMarquardt's Method _g116 -- _g3.3.5 _tConjugate Gradient Methods _g117 -- _g3.3.6 _tQuasi-Newton Methods _g123 -- _g3.3.7 _tTrust Regions _g127 -- _g3.3.8 _tGradient-Based Algorithm _g128 -- _g3.3.9 _tNumerical Gradient Approximations _g129 -- _g3.4 _tComparison of Methods and Numerical Results _g130 -- _g4 _tLinear Programming _g149 -- _g4.1 _tFormulation of Linear Programming Models _g149 -- _g4.2 _tGraphical Solution of Linear Programs in Two Variables _g154 -- _g4.3 _tLinear Program in Standard Form _g158 -- _g4.3.1 _tHandling Inequalities _g159 -- _g4.3.2 _tHandling Unrestricted Variables _g159 -- _g4.4 _tPrinciples of the Simplex Method _g161 -- _g4.4.1 _tMinimization Problems _g172 -- _g4.4.2 _tUnbounded Optimum _g173 -- _g4.4.3 _tDegeneracy and Cycling _g174 -- _g4.4.4 _tUse of Artificial Variables _g174 -- _g4.4.5 _tTwo-Phase Simplex Method _g176 -- _g4.5 _tComputer Solution of Linear Programs _g177 -- _g4.5.1 _tComputer Codes _g177 -- _g4.5.2 _tComputational Efficiency of the Simplex Method _g179 -- _g4.6 _tSensitivity Analysis in Linear Programming _g180 -- _g4.7 _tApplications _g183 -- _g4.8 _tAdditional Topics in Linear Programming _g183 -- _g4.8.1 _tDuality Theory _g184 -- _g4.8.2 _tDual Simplex Method _g188 -- _g4.8.3 _tInterior Point Methods _g189 -- _g4.8.4 _tInteger Programming _g205 -- _g4.8.5 _tGoal Programming _g205 -- _g5 _tConstrained Optimality Criteria _g218 -- _g5.1 _tEquality-Constrained Problems _g218 -- _g5.2 _tLagrange Multipliers _g219 -- _g5.3 _tEconomic Interpretation of Lagrange Multipliers _g224 -- _g5.4 _tKuhn-Tucker Conditions _g225 -- _g5.4.1 _tKuhn-Tucker Conditions or Kuhn-Tucker Problem _g226 -- _g5.4.2 _tInterpretation of Kuhn-Tucker Conditions _g228 -- _g5.5 _tKuhn-Tucker Theorems _g229 -- _g5.6 _tSaddlepoint Conditions _g235 -- _g5.7 _tSecond-Order Optimality Conditions _g238 -- _g5.8 _tGeneralized Lagrange Multiplier Method _g245 -- _g5.9 _tGeneralization of Convex Functions _g249 -- _g6 _tTransformation Methods _g260 -- _g6.1 _tPenalty Concept _g261 -- _g6.1.1 _tVarious Penalty Terms _g262 -- _g6.1.2 _tChoice of Penalty Parameter R _g277 -- _g6.2 _tAlgorithms, Codes, and Other Contributions _g279 -- _g6.3 _tMethod of Multipliers _g282 -- _g6.3.1 _tPenalty Function _g283 -- _g6.3.2 _tMultiplier Update Rule _g283 -- _g6.3.3 _tPenalty Function Topology _g284 -- _g6.3.4 _tTermination of the Method _g285 -- _g6.3.5 _tMOM Characteristics _g286 -- _g6.3.6 _tChoice of R-Problem Scale _g289 -- _g6.3.7 _tVariable Bounds _g289 -- _g6.3.8 _tOther MOM-Type Codes _g293 -- _g7 _tConstrained Direct Search _g305 -- _g7.1 _tProblem Preparation _g306 -- _g7.1.1 _tTreatment of Equality Constraints _g306 -- _g7.1.2 _tGeneration of Feasible Starting Points _g309 -- _g7.2 _tAdaptations of Unconstrained Search Methods _g309 -- _g7.2.1 _tDifficulties in Accommodating Constraints _g310 -- _g7.2.2 _tComplex Method _g312 -- _g7.3 _tRandom-Search Methods _g322 -- _g7.3.1 _tDirect Sampling Procedures _g322 -- _g7.3.2 _tCombined Heuristic Procedures _g326 -- _g8 _tLinearization Methods for Constrained Problems _g336 -- _g8.1 _tDirect Use of Successive Linear Programs _g337 -- _g8.1.1 _tLinearly Constrained Case _g337 -- _g8.1.2 _tGeneral Nonlinear Programming Case _g346 -- _g8.1.3 _tDiscussion and Applications _g355 -- _g8.2 _tSeparable Programming _g359 -- _g8.2.1 _tSingle-Variable Functions _g359 -- _g8.2.2 _tMultivariable Separable Functions _g362 -- _g8.2.3 _tLinear Programming Solutions of Separable Problems _g364 -- _g8.2.4 _tDiscussion and Applications _g368 -- _g9 _tDirection Generation Methods Based on Linearization _g378 -- _g9.1 _tMethod of Feasible Directions _g378 -- _g9.1.1 _tBasic Algorithm _g380 -- _g9.1.2 _tActive Constraint Sets and Jamming _g383 -- _g9.2 _tSimplex Extensions for Linearly Constrained Problems _g388 -- _g9.2.1 _tConvex Simplex Method _g389 -- _g9.2.2 _tReduced Gradient Method _g399 -- _g9.2.3 _tConvergence Acceleration _g403 -- _g9.3 _tGeneralized Reduced Gradient Method _g406 -- _g9.3.1 _tImplicit Variable Elimination _g406 -- _g9.3.2 _tBasic GRG Algorithm _g410 -- _g9.3.3 _tExtensions of Basic Method _g419 -- _g9.3.4 _tComputational Considerations _g427 -- _g9.4 _tDesign Application _g432 -- _g9.4.1 _tProblem Statement _g433 -- _g9.4.2 _tGeneral Formulation _g434 -- _g9.4.3 _tModel Reduction and Solution _g437 -- _g10 _tQuadratic Approximation Methods for Constrained Problems _g450 -- _g10.1 _tDirect Quadratic Approximation _g451 -- _g10.2 _tQuadratic Approximation of the Lagrangian Function _g456 -- _g10.3 _tVariable Metric Methods for Constrained Optimization _g464 -- _g10.4.1 _tProblem Scaling _g470 -- _g10.4.2 _tConstraint Inconsistency _g470 -- _g10.4.3 _tModification of H[superscript (t)] _g471 -- _g10.4.4 _tComparison of GRG with CVM _g471 -- _g11 _tStructured Problems and Algorithms _g481 -- _g11.1 _tInteger Programming _g481 -- _g11.1.1 _tFormulation of Integer Programming Models _g482 -- _g11.1.2 _tSolution of Integer Programming Problems _g484 -- _g11.1.3 _tGuidelines on Problem Formulation and Solution _g492 -- _g11.2 _tQuadratic Programming _g494 -- _g11.2.1 _tApplications of Quadratic Programming _g494 -- _g11.2.2 _tKuhn-Tucker Conditions _g498 -- _g11.3 _tComplementary Pivot Problems _g499 -- _g11.4 _tGoal Programming _g507 -- _g12 _tComparison of Constrained Optimization Methods _g530 -- _g12.1 _tSoftware Availability _g530 -- _g12.2 _tA Comparison Philosophy _g531 -- _g12.3 _tBrief History of Classical Comparative Experiments _g533 -- _g12.3.1 _tPreliminary and Final Results _g535 -- _g13 _tStrategies for Optimization Studies _g542 -- _g13.1 _tModel Formulation _g543 -- _g13.1.1 _tLevels of Modeling _g544 -- _g13.1.2 _tTypes of Models _g548 -- _g13.2 _tProblem Implementation _g552 -- _g13.2.1 _tModel Assembly _g553 -- _g13.2.2 _tPreparation for Solution _g554 -- _g13.2.3 _tExecution Strategies _g580 -- _g13.3 _tSolution Evaluation _g588 -- _g13.3.1 _tSolution Validation _g589 -- _g13.3.2 _tSensitivity Analysis _g590 -- _g14 _tEngineering Case Studies _g603 -- _g14.1 _tOptimal Location of Coal-Blending Plants by Mixed-Integer Programming _g603 -- _g14.1.1 _tProblem Description _g604 -- _g14.1.2 _tModel Formulation _g604 -- _g14.1.3 _tResults _g609 -- _g14.2 _tOptimization of an Ethylene Glycol-Ethylene Oxide Process _g610 -- _g14.2.1 _tProblem Description _g610 -- _g14.2.2 _tModel Formulation _g612 -- _g14.2.3 _tProblem Preparation _g618 -- _g14.2.4 _tDiscussion of Optimization Runs _g618 -- _g14.3 _tOptimal Design of a Compressed Air Energy Storage System _g621 -- _g14.3.1 _tProblem Description _g621 -- _g14.3.2 _tModel Formulation _g622 -- _g14.3.3 _tNumerical Results _g627 -- _gAppendix A _tReview of Linear Algebra _g633 -- _gA.1 _tSet Theory _g633 -- _gA.2 _tVectors _g633 -- _gA.3 _tMatrices _g634 -- _gA.3.1 _tMatrix Operations _g635 -- _gA.3.2 _tDeterminant of a Square Matrix _g637 -- _gA.3.3 _tInverse of a Matrix _g637 -- _gA.3.4 _tCondition of a Matrix _g639 -- _gA.3.5 _tSparse Matrix _g639 -- _gA.4 _tQuadratic Forms _g640 -- _gA.4.1 _tPrincipal Minor _g641 -- _gA.4.2 _tCompleting the Square _g642 -- _gA.5 _tConvex Sets _g646 -- _gAppendix B _tConvex and Concave Functions _g648 -- _gAppendix C _tGauss-Jordan Elimination Scheme _g651.
650		0	_aEngineering _xMathematical models.
650		0	_aMathematical optimization.
700	1		_aReklaitis, G. V., _d1942-
700	1		_aRagsdell, K. M.
856	4	2	_3Publisher description _uhttp://catdir.loc.gov/catdir/enhancements/fy0653/2005044611-d.html
856	4	1	_3Table of contents only _uhttp://catdir.loc.gov/catdir/enhancements/fy0653/2005044611-t.html
856	4	2	_3Contributor biographical information _uhttp://catdir.loc.gov/catdir/enhancements/fy0826/2005044611-b.html
942			_cBOOK
994			_aZ0 _bSUPMU
596			_a1
999			_c3587 _d3587