In this paper, we determine the sufficient Karush-Kuhn-Tucker (KKT) conditions of optimality of a set-valued fractional programming problem (in short, SVFP)
- Article type
- Year
- Co-author
Open Access
Research Article
Issue
Open Access
Research Article
Issue
Since not every problem in optimization theory involves convex functionals, in this study, we introduced new classes of generalized convex functionals. More precisely, under generalized hypotheses, we stated new efficiency conditions associated with a class of multiple-objective optimal control models. To this end, we first defined the
Open Access
Research Article
Issue
In this study, we established several relations between generalized (weak) vector controlled inequalities of Minty and Stampacchia type and the associated multi-cost models. To this end, we introduced the updated concepts of preconvexity and (strictly) strong convexity for functionals governed by controlled simple integrals and a mean-value-type result. Also, we introduced the corresponding multiobjective extremization models. The theoretical notions and the main results were justified by suitable numerical examples that were non-trivial.
Open Access
Research Article
Issue
This paper investigated a new family of robust multidimensional controlled models with constant-level set constraints. More precisely, we considered the extremization of a functional, given by a controlled multiple integral involving an uncertain parameter, subject to a finite set of constraints determined by path-independent curvilinear integral functionals. Necessary and sufficient optimality criteria were established for a robust feasible point. In addition, a saddle-point-type characterization of robust optimal points was studied in the second part of the paper.
京公网安备11010802044758号