Development Of Software For Solving Multistage Problems By The Method Of Dynamic Programming With Separabel Breaking
Main Article Content
Abstract
This paper discusses how to solve multi-step processes in the form of a matrix and solve problems through dynamic programming. Typically, in practice, the problem of constructing models of multi-stage processes is, as a rule, complicated by the versatility, uncertainty and nonlinearity of the modeled objects, complete or partial lack of expert experience and analytical description of the dependencies. The transition from one state to another is manifested as a function, and when the study is carried out at the analytical level, additional conditions are required, such as the production of the first, sometimes the second, function. If we express the state of multi-step procedures in the form of a matrix, the problem can be solved using dynamic programming
Downloads
Metrics
Article Details
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.