Sensitivity analysis of abnormal cone-constrained optimization problems constraint. This includes
mathematical programming problems and some other problem settings. In contrast
Control of system dynamics and constraints stabilizationProblems of
program control for dynamic systems with elements of various physical natures
Immobile Indices and CQ-Free Optimality Criteria for Linear Copositive Programming ProblemsWe consider problems of linear copositive
programming where feasible sets consist of vectors
Immobile indices and CQ-free optimality criteria for Linear Copositive Programming problemsKostyukova, O. I.,
Tchemisova, T. V.,
Dudina, O. S.,
Костюкова, О. И.,
Чемисова, Т. В.,
Дудина, О. С. We consider problems of linear copositive
programming where feasible sets consist of vectors
Second order sufficient condition for infinite-dimensional extremal problems; R - the space of real numbers) the minimization problem is considered with
constraints: f0(x)→MIN, F
Necessary optimality conditions without a priori normality assumptions-degeneracy of
constraints) they remain informative (not degenerate). A typical example for such type of optimization problem
Dynamic pricing with demand disaggregation for hotel revenue management, and a
mathematical programming model with concave quadratic objective function and linear
constraints On optimal properties of special semiinfinite problems arising in parametric optimizationWe consider a special Nonlinear
Programming problem depending on integer parameters. For some