Web-Books
in the Austria-Forum
Austria-Forum
Web-Books
Informatik
Algorithms for Scheduling Problems
Page - 151 -
  • User
  • Version
    • full version
    • text only version
  • Language
    • Deutsch - German
    • English

Page - 151 - in Algorithms for Scheduling Problems

Image of the Page - 151 -

Image of the Page - 151 - in Algorithms for Scheduling Problems

Text of the Page - 151 -

Algorithms 2018,11, 57 Specialized methods and algorithms General methods and algorithms direct methods and algorithms Euler method Ritz-Galerkin’s method special methods of nonlinear programming Methods and algorithms of optimal control indirect methods and algorithms methods of reduction to finite-dimensional problems methods of state- space search methods of gradient notion in control space gradient methods of unconstrained optimization methods of gradient projection gradient methods based on penalty functions methods and algorithms based on Bellman’s principle of optimality methods and algorithms of variations in a state space methods and algorithms for two-point boundary problems methods of successive approximations methods of perturbation theory methods based on necessary conditions of optimal control methods of state- space search combined methods methods and algorithms for linear- problems of optimal control approximate analytical methods and algorithms methods and algorithms for linear time-minimization problems methods and algorithms for linear problems with quadratic objective functions methods and algorithms for quasi-linear systems methods and algorithms for system with weak controlability averaging approximate methods and algorithms \ \ U\ \ U\ U Figure2.Optimalcontrol computationalmethods. Newton’s method and its modifications. For the first iteration of the method, an initial approximationψ(T0) = ψ(0)(T0) is set. Then, the successive approximations are received from theformula: ψ(r)(T0)=ψ(rāˆ’1)(T0)āˆ’ [ āˆ‚Ļ(rāˆ’1)(Tf) āˆ‚Ļˆ(rāˆ’1)(T0) ] ρ(rāˆ’1)(Tf) (11) whereρ(r)(Tf)=aāˆ’x(rāˆ’1)(Tf), r=1,2, . . . . Theoperationofpartialderivation,beingperformedatall iterations, is rathercomplicated.Here thederivativematrix: Π˜= ( āˆ‚Ļ(rāˆ’1)(Tf) āˆ‚Ļˆ(rāˆ’1)(T0) ) (12) shouldbeevaluated. Thismatrixcanbereceivedeitherviafinite-difference formulasorviaavariational integration of thesystem.Modificationof themethodcanalsobeused. The followingmethod is the simplest. Theformula (11) is substitutedfor: ψ(r)(T0)=ψ(rāˆ’1)(T0)āˆ’Ī³(r)Ī Ėœāˆ’1ρ(rāˆ’1)(Tf) (13) 151
back to the  book Algorithms for Scheduling Problems"
Algorithms for Scheduling Problems
Title
Algorithms for Scheduling Problems
Authors
Frank Werner
Larysa Burtseva
Yuri Sotskov
Editor
MDPI
Location
Basel
Date
2018
Language
English
License
CC BY 4.0
ISBN
978-3-03897-120-7
Size
17.0 x 24.4 cm
Pages
212
Keywords
Scheduling Problems in Logistics, Transport, Timetabling, Sports, Healthcare, Engineering, Energy Management
Categories
Informatik
Technik
Web-Books
Library
Privacy
Imprint
Austria-Forum
Austria-Forum
Web-Books
Algorithms for Scheduling Problems