Дуальний метод програмування
The optimization problem is interpreted as the choice of such a combination of arguments (independent variables) that, under given external influences and constraints, delivers an extremum of the objective function. The objective function reflects the concept of optimization criterion. With several...
Saved in:
| Date: | 2023 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | Ukrainian |
| Published: |
V.M. Glushkov Institute of Cybernetics of NAS of Ukraine
2023
|
| Subjects: | |
| Online Access: | https://jais.net.ua/index.php/files/article/view/55 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Problems of Control and Informatics |
Institution
Problems of Control and Informatics| Summary: | The optimization problem is interpreted as the choice of such a combination of arguments (independent variables) that, under given external influences and constraints, delivers an extremum of the objective function. The objective function reflects the concept of optimization criterion. With several criteria, the objective function has the meaning of a scalar convolution of the criteria. The essence of the concept of optimization is the extremization of the objective function. This applies to decision-making problems, and to management problems, and to other subject areas. A non-local method of mathematical programming is proposed, which makes it possible to reduce the number of necessary calculations of the objective function. In the optimal design, especially multi-criteria, objective functions are calculated on complex algorithms that require large computing resources and computing time. The proposed method of dual programming is relevant for computer optimization of complex systems. |
|---|