Campos, J. R. [UNESP]Assunção, E. [UNESP]Silva, G. N. [UNESP]Lodwick, W. A.Teixeira, M. C.M. [UNESP]2019-10-062019-10-062019-08-03International Journal of Control, v. 92, n. 8, p. 1778-1784, 2019.1366-58200020-7179http://hdl.handle.net/11449/187647This paper proposes a new approach for the discrete-time interval optimal control problem. The optimal interval solution of discrete-time interval optimal control problem is obtained using the single-level constrained interval arithmetic coupled with a dynamic programming technique. Moreover, the optimal interval solution contains the real-valued optimal solutions. To illustrate an optimal solution for the interval case, we use the minimax regret criterion in the interval inventory control problem we present.1778-1784enggeneralised uncertaintyinterval dynamic programminginterval mathematical modelsInterval optimal control problemminimax regret criterionArtigo10.1080/00207179.2017.1410575Acesso aberto2-s2.0-85065517078