The combinatorial optimization problems of the discrete processes
Articles
Nijolė Janušauskaitė
Kaunas University of Technology
Published 2021-06-15
https://doi.org/10.15388/LMR.2007.24242
PDF

Keywords

dynamic programming
optimal control
maximum principle

How to Cite

Janušauskaitė, N. (2021) “The combinatorial optimization problems of the discrete processes”, Lietuvos matematikos rinkinys, 47(spec.), pp. 453–456. doi:10.15388/LMR.2007.24242.

Abstract

Nonclassic combinatorial optimization problems of the discrete processes are investigated. The methodology, permitting transform there problems into equivalent typical problems, which can be solved applying dynamic programming and principle of the maximum methods, is proposed.

PDF

Downloads

Download data is not yet available.