Mixed duality without a constraint qualification for minimax fractional programming
Considered is the following minimax fractional programming problem: \[ \text{(P)}\qquad \qquad \min_{x\in S}~\max_{1\leq i\leq p}[f_{i}(x)/g_{i}(x)] \] where \(S=\left\{ x\in \mathbb R^{n}~| ~h_{j}(x)\leq 0,~j=1,2,...,m\right\} ,~f_{i}-g_{i},~h_{j}:\mathbb R^{n}\rightarrow \mathbb R\) are differentiable pseudoconvex functions and \(f_{i}(x)\geq 0,~g_{i}(x)>0\). Without any constraint qualification, the authors establish the necessary and sufficient optimality conditions for Problem (P). They use these optimality conditions to formulate a mixed dual model which unifies the Mond-Weir dual, Wolfe dual and parameter dual models. Weak, strong and strict converse dual theorems are proved.
- 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
- 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
- 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)