A STUDY ON THE DUALITY OF MULTI-OBJECTIVE E-CONVEX PROGRAMMING

Purchase PDF

Published: 2015-10-01

Page: 1-13


A. A. MEGAHED *

Department of Basic Science, Faculty of Computers and Informatics, Suez Canal University, Ismailia, Egypt and Mathematics Department, Faculty of Science at Zulfi City, Majmaah University, P.O.Box 1712, Zip Code 11932, KSA

*Author to whom correspondence should be addressed.


Abstract

In this paper, we will study the duality of the multi-objective nonlinear programming problem, where the feasible region is an E- convex set and the objective function is an E-convex functions. The concept of weak minimum and different scalar duality results are extended to multi-objective E-convex programming problem.

Weak and strong duality theorems are given under a variety of generalized convexity conditions.

Keywords: E-convex set, E-convex function, duality, multi-objective programming


How to Cite

MEGAHED, A. A. (2015). A STUDY ON THE DUALITY OF MULTI-OBJECTIVE E-CONVEX PROGRAMMING. Asian Journal of Mathematics and Computer Research, 8(1), 1–13. Retrieved from https://ikprress.org/index.php/AJOMCOR/article/view/452

Downloads

Download data is not yet available.