Extension to Sufficient Optimality Conditions in Complex Programming
- 1 Department of Mathematics, Faculty of Science, Tanta University, Egypt
Abstract
In this study we extend the sufficient optimality conditions of complex programming problems to a large class of functions that include the two parts (real and imaginary) of the objective function. The sufficient conditions were established under generalized forms of convexity assumptions. The previous results that considered the real part only can be deduced as special cases.
DOI: https://doi.org/10.3844/jmssp.2005.40.48
Copyright: © 2005 E. A. Youness and M. E. Elbrolosy. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
- 2,685 Views
- 2,445 Downloads
- 8 Citations
Download
Keywords
- Complex Programming Problems
- Optimality Conditions
- Polyhedral Cone
- Pointed Cone
- Generalized Convexity
- Pointed Cone and Generalized Convexity