Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
From MaRDI portal
Publication:4764579
DOI10.1080/02331939508844040zbMath0821.90112OpenAlexW1984166952MaRDI QIDQ4764579
Publication date: 27 September 1995
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939508844040
optimality conditionspre-Hilbert space\(\rho\)-convex functionsduality modelsnonsmooth generalized fractional programminglocal subgradientnearly convex function
Nonlinear programming (90C30) Fractional programming (90C32) Programming in abstract spaces (90C48) Convexity of real functions of several variables, generalizations (26B25)
Related Items (21)
Sufficient optimality criteria and duality for nondifferentiable fractional variational problems with generalized (F, ρ)-convexity ⋮ Saddle-point-type optimality conditions and lagrangian-type duality for a class of constrained generalized fractional optimal control ⋮ A fifth bibliography of fractional programming* ⋮ Minimax fractional programming involving generalised invex functions ⋮ Minimax fractional programming under nonsmooth generalized \((\mathcal F,\rho, \theta)\)-d-univexity ⋮ Duality for nondifferentiable static multiobjective variational problems involving generalized \((F,\rho)\)-convex functions ⋮ Mixed Lagrange function in minimax fractional programming problems ⋮ Generalized fractional programming problems containing locally subdifferentiable andρ-Univex functions ⋮ Optimality and duality for generalized fractional variational problems involving generalized (fρ)-convex functions ⋮ Optimality and duality for multiobjective fractional programming involving nonsmooth pseudoinvex functions ⋮ Three types dual model for minimax fractional programming ⋮ Optimality and duality for multiobjective fractional programming involving nonsmooth($si:F$esi:ρ)–convex functions ⋮ Parametric nondifferentiable multiobjective fractional programming under (b;;; )-univexity ⋮ Generalized fractional minimax programming with \(B-(p,r)\)-invexity ⋮ Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions ⋮ Parametric approach to multitime multiobjective fractional variational problems under (F,ρ)-convexity ⋮ Optimality and duality results for \(E\)-differentiable multiobjective fractional programming problems under \(E\)-convexity ⋮ Mixed duality without a constraint qualification for minimax fractional programming ⋮ Necessary and sufficient conditions for minimax fractional programming ⋮ Duality without a constraint qualification for minimax fractional programming ⋮ On Minimax Fractional Semi-Infinite Programming Problems with Applications
Cites Work
- An algorithm for generalized fractional programs
- Generalized fractional programming: Algorithms and numerical experimentation
- A note on an algorithm for generalized fractional programs
- Saddle-point type optimality criteria for generalized fractional programming
- Conjugate duality in generalized fractional programming
- Generalized fractional programming duality: A parametric approach
- Fractional programming - a survey
- Convergence of interval-type algorithms for generalized fractional programming
- Generalized Farkas' theorem and optimization of infinitely constrained problems
- Duality for a class of quasiconvex programs
- Duality in generalized fractional programming via Farkas' lemma
- Goal programming and multiple objective optimizations. Part I
- A class of programming problems whose objective function contains a norm
- Generalized fractional programming: Optimality and duality theory
- Duality for generalized fractional programs involving n-set functions
- Proper efficiency and duality for a class of constrained multiobjective fractional optimal control problems containing arbitrary norms
- Optimality conditions and duality for a class of continuous-time generalized fractional programming problems
- Duality in generalized linear fractional programming
- Optimality conditions and algorithms for parameter design problems with two-level structure
- Generalized Cheney-Loeb-Dinkelbach-Type Algorithms
- An Algorithm for a Class of Nonconvex Programming Problems with Nonlinear Fractional Objectives
- Convergence of a Dinkelbach-type algorithm in generalized fractional programming
- Partial linearization for generalized fractional programming
- A duality model for a generalized minmax program
- Optimality Conditions for Quasi-Differentiable Programs with Application to Two-Level Optimization
- Global saddle-point duality for quasi-concave programs, II
- Bibliography in fractional programming
- Defense Applications of Mathematical Programs with Optimization Problems in the Constraints
- Generalized fractional programming duablity: a ratio game approach
- A transposition theorem with applications to constrained optimal control problems
- Optimality conditions and duality models for a class of nonsmooth constrained fractional variational problems
- The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation
- Best Rational Approximation and Strict Quasi-Convexity
- Mathematical Programs with Optimization Problems in the Constraints
- Sufficient conditions for extremum, penalty functions and regularity
This page was built for publication: Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
