Buradasınız

Anasayfa » Content

Complex Analysis Methods Related an Optimization Problem with Complex Variables

Journal Name:

  • European Journal of Pure and Applied Mathematics

Publication Year:

  • 2010

Key Words:

Author NameUniversity of Author

AMS Codes:

Abstract (2. Language): 
In this paper, we consider a nondifferentiable minimax fractional programming problem treated with complex variables. Duality problem in optimization theory plays an important role. The goal of this paper is to formulate the Wolfe type dual and Mond-Weir type dual problems. We aim to establish the duality problems, and prove that the duality theorems have no duality gap to the primal problem under some assumptions. The processes involves to show three theorems: the weak, strong and strictly converse duality theorem.
Bookmark/Search this post with
FULL TEXT (PDF): 
PDF icon arastirmax-complex-analysis-methods-related-optimization-problem-complex-variables.pdf
  • 6
989-1005
  • English

REFERENCES

References: 

[1] O. Ferrero. On nonlinear programming in complex space. Journal of Mathematical Anal-
ysis and Applications, 164:399-416, 1992.
[2] S. Haykin. Adaptive Filter Theory, 3 rd edition. Prentice-Hill, Englewood cliffs, New Jersey,
1996.
[3] H.C. Lai and T.Y. Huang. Optimality conditions for nondifferentiable minimax fractional
programming with complex variables. Journal of Mathematical Analysis and Applications,
359:229-239, 2009.
[4] H.C. Lai and T.Y. Huang. Optimality conditions for a nondifferentiable minimax programming
in complex spaces. Nonlinear Analysis, 71:1205-1212, 2009.
[5] H.C. Lai and J.C. Lee. On duality theorems for a nondifferentiable minimax fractional
programming. Journal Computational and Applied Mathematics, 146:115-126, 2002.
[6] H.C. Lai, J.C. Lee and S.C. Ho. Parametric duality on minimax programming involving
generalized convexity in complex space. Journal of Mathematical Analysis and Applica-
tions, 323:1104-1115, 2006.
[7] H.C. Lai and J.C. Liu. Complex fractional programming involving generalized
quasi/pseudo convex functions. Zeitschrift fur Angewandte Mathematik und Mechanik,
82(3):159-166, 2002.
[8] H.C. Lai, J.C. Liu and S. Schaible. Complex minimax fractional programming of analytic
functions. Journal of Optimization Theory and Applications, 137(1):171-184, 2008.
[9] H.C. Lai and J.C. Liu. Duality for nondifferentiable minimax programming in complex
spaces. Nonlinear Analysis, 71:e224-e233, 2009.
[10] N. Levinson. Linear programming in complex space. Journal of Mathematical Analysis
and Applications, 14:44-62, 1966.
[11] B. Mond. Nonlinear complex programming. Journal of Mathematical Analysis and Appli-
cations, 43:633-641, 1973.
[12] B. Mond and T. Weir. Generalized convexity and duality. In S. Schaible and W.T.
Zieinba,editors, Generalized concavity in Optimization and economics, 263-2793, Academic
Press, NewYork, 1981.
[13] O. Parkash, P.C. Saxena and V. Patkar. Nondifferentiable fractional programming in complex
space. Zeitschrift fur Angewandte Mathematik und Mechanik, 64(1):59-62, 1984.
[14] K. Swarup and J.C. Sharma. Programming with linear fractional functionals in complex
spaces. Cahiers du centre d’Etudes et de Recherche Operationelle, 12:103-109, 1970.
[15] P. Wolfe. A duality theorem for nonlinear programming. Quarterly of Applied Mathemat-
ics, 19:239-244, 1961.

Thank you for copying data from http://www.arastirmax.com