On second-order duality for a class of nondifferentiable minimax fractional programming problem with \((C,\alpha,\rho,d)\)-convexity (Q2511379)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On second-order duality for a class of nondifferentiable minimax fractional programming problem with \((C,\alpha,\rho,d)\)-convexity |
scientific article |
Statements
On second-order duality for a class of nondifferentiable minimax fractional programming problem with \((C,\alpha,\rho,d)\)-convexity (English)
0 references
5 August 2014
0 references
The paper deals with the following nondifferentiable minimax fractional programming problem: \[ \xi (x) ~=~ \sup_{y \in Y} (f(x,y) + x^TBx)/ (h(x,y) - x^TDx) ~\longmapsto~ \min \] subject to \[ g(x) \leq 0, \] where \(Y\) is a compact set, \(f(x,y), ~ h(x,y)\) are twice continuously differentiable real functions on \(\mathbb{R}^n \times \mathbb{R}^l\), \(g: \mathbb{R}^n \longmapsto \mathbb{R}^m\) is twice continuously differentiable on \(\mathbb{R}^n\), and \(B,~D \) are positive semidefinite \(n \times n\) matrices. Three duality models for this optimization problem are proposed. For each of the models weak, strong and strictly converse duality theorems are proved under appropriate convexity assumptions.
0 references
minimax fractional programming
0 references
second-order duality
0 references
non-differentiable programming problems
0 references
0 references
0 references
0 references
0 references