Theory and Techniques of Optimization for Practicing EngineersBarnes & Noble, 1971 - 326 strani |
Pogosti izrazi in povedi
adjoint equations adjoint variable algorithm b₁ b₂ base point boundary conditions Calculus of Variations computed consider constant constrained derivatives constraint equations contour cost Cramer's Rule d₁ d₂ decision policy decision variables differential equation dx dt dynamic programming equa equal Euler-Lagrange equation example expression extremum feasible region feasible solutions Figure func function evaluations geometric programming gradient direction Hamiltonian Hence independent variables initial integral interval k₁ k₂ Kuhn-Tucker conditions Lagrange multiplier linear programming maximize maximum principle method minimized mixing coefficients necessary conditions nonlinear objective function obtained optimal policy optimum parameter optimization problem partial derivatives perturbation posynomial Practicing Engineers prob programming problem quadratic programming region of feasible satisfy selected simplex algorithm solved specified stage Substitution surplus variables system equations test point Theorem tion trajectory optimization problem V₁ vanish x₁ XN+1 yields zero αλ Δλ дх