Computer algorithms for solving optimization problems for discrete-time fractional systems

Dynamic programming and discrete-time calculus of variations optimization problems for fractional discrete-time systems with quadratic performance index have been formulated and solved. A new methods for numerical computation of optimization problems have been presented. The efficiency of the methods have been demonstrated on numerical example and illustrated by graphs. Graphs also show the differences between the fractional and classical (standard) systems theory. Results for both methods have been obtained through a computer algorithms written for this purpose.