Mixed Lagrange function in minimax fractional programming problems
From MaRDI portal
Recommendations
- Minmax fractional programming problem involving generalized convex functions
- Minimax fractional programming involving generalised invex functions
- Minimax fractional programming for n-set functions and mixed-type duality under generalized Invexity
- Mixed duality without a constraint qualification for minimax fractional programming
- Mixed type duality for a nondifferentiable minimax fractional complex programming
- Mixed Lagrangian and multiobjective fractional programming duality with generalized -convex n-set functions
- Optimality conditions for fractional minmax programming
- A solvability theorem and minimax fractional programming
- scientific article; zbMATH DE number 2162238
Cites work
- A new characterization on optimality and duality for nondifferentiable minimax fractional programming problems
- Convex Analysis
- Duality and saddle-point type optimality for generalized nonlinear fractional programming.
- Duality for nonsmooth minimax fracional programming with exponential \((p,r)\)-invexity
- Duality in nondifferentiable minimax fractional programming with generalized convexity
- Duality on a nondifferentiable minimax fractional programming
- Generalized fractional programming duality: A parametric approach
- scientific article; zbMATH DE number 4055404 (Why is no real title available?)
- Mixed-Type Duality on Nonsmooth Minimax Fractional Programming Involving Exponential (p, r)-Invexity
- On incomplete Lagrange function and saddle point optimality criteria in mathematical programming
- On optimality conditions in nondifferentiable programming
- Optimality and duality for generalized fractional programming involving nonsmooth pseudoindex functions
- Optimality and duality for nonsmooth minmax fractional programming problem with exponential (p,r)-invexity
- Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
- Optimization and nonsmooth analysis
- Saddle point criteria and duality in multiobjective programming via an η-approximation method
- Saddle point criteria in multiobjective fractional programming involving exponential invexity
- Saddle point criteria in semi-infinite minimax fractional programming under \((\Phi,\rho)\)-invexity
- 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
Cited in
(1)
This page was built for publication: Mixed Lagrange function in minimax fractional programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5101835)
