|
Optimization of the Optimal Value Function in Problems of Convex Parametric Programming
O. V. Khamisov L. A. Melentiev Energy Systems Institute, Siberian Branch of the Russian Academy of Sciences, Irkutsk
Abstract:
We consider a problem of convex parametric programming in which the objective function and the constraint functions are convex functions of an external parameter. Computational procedures are suggested for finding the maximum and minimum values of the optimal value function and for finding inner and outer approximations to the set of parameters for which the problem is consistent. All procedures are based on the application of support functions. Illustrative examples are provided.
Keywords:
parametric optimization, optimal value function, support function, inner and outer approximation.
Received: 13.06.2023 Revised: 14.08.2023 Accepted: 21.08.2023
Citation:
O. V. Khamisov, “Optimization of the Optimal Value Function in Problems of Convex Parametric Programming”, Trudy Inst. Mat. i Mekh. UrO RAN, 29, no. 3, 2023, 247–260; Proc. Steklov Inst. Math. (Suppl.), 323, suppl. 1 (2023), S133–S145
Linking options:
https://www.mathnet.ru/eng/timm2029 https://www.mathnet.ru/eng/timm/v29/i3/p247
|
Statistics & downloads: |
Abstract page: | 62 | Full-text PDF : | 16 | References: | 17 | First page: | 4 |
|