Mixed duality without a constraint qualification for minimax fractional programming (Q4467183)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2070901
Language Label Description Also known as
default for all languages
No label defined
    English
    Mixed duality without a constraint qualification for minimax fractional programming
    scientific article; zbMATH DE number 2070901

      Statements

      Mixed duality without a constraint qualification for minimax fractional programming (English)
      0 references
      0 references
      0 references
      0 references
      9 June 2004
      0 references
      fractional programming
      0 references
      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.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references