Saddle-point type optimality criteria for generalized fractional programming
From MaRDI portal
Publication:1090248
DOI10.1007/BF00939335zbMath0619.90075OpenAlexW2030837216MaRDI QIDQ1090248
Publication date: 1988
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00939335
local optimal solutiongeneralized fractional programmingglobal optimal solutionssaddle-point type optimality criteria
Related Items (24)
Saddle-point-type optimality conditions and lagrangian-type duality for a class of constrained generalized fractional optimal control ⋮ Saddle point criteria in nonsmooth semi-infinite minimax fractional programming problems ⋮ Multiobjective fractional programming duality. a Lagrangian approach ⋮ OPTIMALITY CONDITIONS AND DUALITY MODELS FOR A CLASS OF NONSMOOTH CONTINUOUS-TIME GENERALIZED FRACTIONAL PROGRAMMING PROBLEMS ⋮ Multiobjective fractional programming duality theory ⋮ Duality for minmax \(B\)-vex programming involving \(n\)-set functions ⋮ Mixed Lagrange function in minimax fractional programming problems ⋮ A Fourth bibliography of fractional programming ⋮ Duality and saddle-point type optimality for generalized nonlinear fractional programming. ⋮ Continuous-time generalized fractional programming ⋮ Saddle-point type optimality criteria and duality relations for generalized fractional programming. ⋮ On quality concepts fractional programming ⋮ On necessary conditions for a class of nondifferentiable minimax fractional programming ⋮ Duality in generalized nonlinear fractional programming ⋮ Constraint qualifications in a class of nondifferentiable mathematical programming problems ⋮ Duality for minmax programming involving nonsmooth v-invex functions ⋮ Mond-Weir type duality involving (B, η)-invex functions for a minmax programming problem ⋮ On minimax fractional optimality and duality with generalized convexity ⋮ A modified objective function method for solving nonlinear multiobjective fractional programming problems ⋮ Minmax programming : optimality and Wolfe type duality for a problem involving bectovex functions ⋮ Generalized fractional programming: Optimality and duality theory ⋮ Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions ⋮ Duality for minmax programming involvingV-invex functions ⋮ On invexity-type nonlinear programming problems
Cites Work
- An algorithm for generalized fractional programs
- Optimality conditions for fractional minmax programming
- Duality in generalized fractional programming via Farkas' lemma
- Goal programming and multiple objective optimizations. Part I
- On functions whose local minima are global
- Parametric approaches to fractional programs
This page was built for publication: Saddle-point type optimality criteria for generalized fractional programming
