Mixed duality without a constraint qualification for minimax fractional programming
From MaRDI portal
Publication:4467183
Recommendations
- Mixed Duality without Constraint Qualification for Nonsmooth Fractional Programming
- Duality without a constraint qualification for minimax fractional programming
- scientific article; zbMATH DE number 4193476
- scientific article; zbMATH DE number 232392
- Duality on a nondifferentiable minimax fractional programming
- Mixed type duality for a nondifferentiable minimax fractional complex programming
- Duality for fractional minimax programming problems
- Sufficient conditions and duality theorems for nondifferentiable minimax fractional programming
- Duality for Fractional Minimax Programming∗∗The research is partly supported by NSC, Taiwan.$ef:
- Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints
Cites work
- An algorithm for generalized fractional programs
- Duality for Fractional Minimax Programming∗∗The research is partly supported by NSC, Taiwan.$ef:
- Duality in generalized linear fractional programming
- Duality without a constraint qualification for minimax fractional programming
- Duality without constraint qualification for multiobjective programming
- Generalized fractional programming duality: A parametric approach
- scientific article; zbMATH DE number 3711742 (Why is no real title available?)
- On minimax fractional optimality conditions with \((F,\rho)\)-convexity
- On mixed duality in mathematical programming.
- Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
- Optimality conditions for fractional minmax programming
Cited in
(6)- Duality without a constraint qualification for minimax fractional programming
- Duality and Lagrange multipliers for nonsmooth multiobjective programming
- A sixth bibliography of fractional programming
- Mixed Lagrange function in minimax fractional programming problems
- Mixed Duality without Constraint Qualification for Nonsmooth Fractional Programming
- A mixed type duality for nonsmooth multiobjective semi-infinite problems with mixed constraints
This page was built for publication: Mixed duality without a constraint qualification for minimax fractional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4467183)