Optimality conditions and duality for a class of continuous-time generalized fractional programming problems
From MaRDI portal
Publication:2639330
DOI10.1016/0022-247X(90)90218-5zbMath0718.49019OpenAlexW2028559668MaRDI QIDQ2639330
Publication date: 1990
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(90)90218-5
continuous-time fractional minmax programmingaffine equality constraintsnonlinear operator inequality
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (17)
Parametric continuous-time linear fractional programming problems ⋮ Sufficient optimality criteria and duality for nondifferentiable fractional variational problems with generalized (F, ρ)-convexity ⋮ Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions ⋮ A fifth bibliography of fractional programming* ⋮ Minimax fractional programming involving generalised invex functions ⋮ Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities ⋮ Continuous-time generalized fractional programming problems. Part I: Basic theory ⋮ Duality for nondifferentiable static multiobjective variational problems involving generalized \((F,\rho)\)-convex functions ⋮ Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems ⋮ A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ Using the parametric approach to solve the continuous-time linear fractional Max-min problems ⋮ Optimality and duality for generalized fractional variational problems involving generalized (fρ)-convex functions ⋮ Continuous-time multiobjective fractional programming ⋮ Three types dual model for minimax fractional programming ⋮ On a recurrence algorithm for continuous-time linear fractional programming problems ⋮ Optimality conditions and duality for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints ⋮ Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions and duality for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints
- An algorithm for generalized fractional programs
- Generalized fractional programming: Algorithms and numerical experimentation
- A note on an algorithm for generalized fractional programs
- Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
- Some remarks concerning duality for continuous-time programming problems
- Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems
- Optimality conditions and duality in continuous programming. I: Convex programs and a theorem of the alternative
- Duality in generalized fractional programming via Farkas' lemma
- Continuous time programming with nonlinear constraints
- Goal programming and multiple objective optimizations. Part I
- Duality in infinite-dimensional mathematical programming: Convex integral functionals
- Continuous time programming with nonlinear time-delayed constraints
- A class of continuous convex programming problems
- Continuous programming. II: Nonlinear objectives
- Duality in generalized linear fractional programming
- 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
- A class of continuous nonlinear programming problems with time‐delayed constraints
- Lagrangian duality for a class of infinite programming problems
- Global saddle-point duality for quasi-concave programs, II
- Bibliography in fractional programming
- Duality for convex functionals: specific cases
- Multicriteria Programming for Financial Planning
- Generalized fractional programming duablity: a ratio game approach
- Duality for a Class of Infinite Programming Problems
- Duality in mathematical programming and some problems of convex analysis
- The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation
- Best Rational Approximation and Strict Quasi-Convexity
This page was built for publication: Optimality conditions and duality for a class of continuous-time generalized fractional programming problems
