
Summary: Both parametric and parameter-free saddle-point- and stationary-point-type necessary and sufficient optimality conditions are established for a class of continuous-time generalized fractional programming problems with convex operator inequality and affine operator equality constraints. Based on the forms and contents of these optimality results, a parameter-free Lagrangian-type, two parametric, and four parameter-free Wolfe-type duality models are constructed and appropriate duality theorems are proved. Furthermore, some of these optimality and duality results are specialized and briefly discussed for an important particular case of the main problem investigated in this paper.
optimality conditions, duality models, continuous-time generalized fractional programming, Fractional programming, convex operator inequality
optimality conditions, duality models, continuous-time generalized fractional programming, Fractional programming, convex operator inequality
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 12 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
