Nondifferentiable minimax fractional programming in complex spaces with parametric duality

Authors:
Hang-Chin Lai;Tone-Yau Huang
Affiliations:
Chung Yuan Christian University, Chung-Li, Taiwan and National Tsing Hua Universith, Hsinchu, Taiwan;Chung Yuan Christian University, Chung-Li, Taiwan
Venue:
Journal of Global Optimization
Year:
2012

Citing 6
Cited 0

Adaptive filter theory (3rd ed.)

Adaptive filter theory (3rd ed.)
Optimality conditions and duality for a class of nonlinear fractional programming proglems

Journal of Optimization Theory and Applications
On duality theorems for a nondifferentiable minimax fractional programming

Journal of Computational and Applied Mathematics - Special issue: Papers presented at the 1st Sino--Japan optimization meeting, 26-28 October 2000, Hong Kong, China
Complex minimax programming under generalized convexity

Journal of Computational and Applied Mathematics
Second order duality for nondifferentiable minimax programming problems with generalized convexity

Journal of Global Optimization
Complex minimax programming under generalized type-I functions

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The purpose of this paper is to study a duality programming problem for a complex nondifferentiable minimax fractional programming with complex variables. The necessary and sufficient optimality conditions are established by Lai and Huang (J Math Anal Appl 359:229---239, 2009). Employing the optimality conditions, we can constitute a parametric dual model problem. Moreover, we establish the duality theorem and prove that optimal values of the duality problem as well as the primary problem are equal under some reasonable assumptions. That is, there are no duality gap between the primary problem and its duality problem.