Optimality principles and duality models for a class of continuous-time generalized fractional programming problems with operator constraints
From MaRDI portal
Publication:4223771
DOI10.1080/09720510.1998.10700978zbMath0912.90269OpenAlexW2086911776MaRDI QIDQ4223771
Publication date: 6 January 1999
Published in: Journal of Statistics and Management Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720510.1998.10700978
optimality conditionscontinuous-time generalized fractional programmingduality modelsconvex operator inequality
Related Items (8)
Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions ⋮ OPTIMALITY CONDITIONS AND DUALITY MODELS FOR A CLASS OF NONSMOOTH CONTINUOUS-TIME GENERALIZED FRACTIONAL PROGRAMMING PROBLEMS ⋮ Generalized parameter-free duality models in discrete minmax fractional programming based on second-order optimality conditions ⋮ Global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing generalized \((\theta,\eta,\rho)\)-V-invex functions and arbitrary norms ⋮ Role of \((\rho , \eta , A)\)-invexity to \(\varepsilon \)-optimality conditions for multiple objective fractional programming ⋮ Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized \((\mathcal F,\rho,\theta)\) -convex functions ⋮ Global parametric sufficient optimality conditions for semi-infinite discrete minmax fractional programming problems involving generalized \((\eta ,\rho )\)-invex functions ⋮ Global Nonparametric Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η, ρ)-Invex Functions
This page was built for publication: Optimality principles and duality models for a class of continuous-time generalized fractional programming problems with operator constraints
