Mixed Lagrange function in minimax fractional programming problems
From MaRDI portal
Publication:5101835
DOI10.3906/mat-2011-91zbMath1493.90183OpenAlexW3187629595MaRDI QIDQ5101835
Publication date: 30 August 2022
Published in: TURKISH JOURNAL OF MATHEMATICS (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3906/mat-2011-91
Minimax problems in mathematical programming (90C47) Nonlinear programming (90C30) Fractional programming (90C32)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Duality on a nondifferentiable minimax fractional programming
- Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions
- Saddle-point type optimality criteria for generalized fractional programming
- Generalized fractional programming duality: A parametric approach
- Duality and saddle-point type optimality for generalized nonlinear fractional programming.
- On incomplete Lagrange function and saddle point optimality criteria in mathematical programming
- Saddle point criteria in multiobjective fractional programming involving exponential invexity
- Optimality and duality for generalized fractional programming involving nonsmooth pseudoindex functions
- Duality in nondifferentiable minimax fractional programming with generalized convexity
- Mixed-Type Duality on Nonsmooth Minimax Fractional Programming Involving Exponential (p, r)-Invexity
- Saddle point criteria and duality in multiobjective programming via an η-approximation method
- Optimization and nonsmooth analysis
- On optimality conditions in nondifferentiable programming
- Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
- Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity
- Convex Analysis
This page was built for publication: Mixed Lagrange function in minimax fractional programming problems
