Research Article Open Access

On Quasi E-Convex Bilevel Programming Problem

E. A. Youness and O. M.A. Al-Olaa

Abstract

Bilevel programming problems involve two optimization problems where the data of the first one is implicity determined by the solution of the second. This study introduces the notions of E-convexity and quasi E-convexity in bilevel programming problems to generalize quasi convex bilevel programming problems.

American Journal of Applied Sciences
Volume 2 No. 2, 2005, 565-568

DOI: https://doi.org/10.3844/ajassp.2005.565.568

Submitted On: 2 March 2006 Published On: 28 February 2005

How to Cite: Youness, E. A. & Al-Olaa, O. M. (2005). On Quasi E-Convex Bilevel Programming Problem. American Journal of Applied Sciences, 2(2), 565-568. https://doi.org/10.3844/ajassp.2005.565.568

  • 1,628 Views
  • 1,925 Downloads
  • 0 Citations

Download

Keywords

  • Bilevel Programming
  • E-convex Sets
  • Quasi E-convex Functions
  • Extreme Point