On the Quasiconcave Multilevel Programming Problems

Abstract

Multilevel programming appears in many decision-making situations. Investigation of the main properties of quasiconcave multilevel programming (QCMP) problems, to date, is limited to bilevel programming (only two levels). In this paper, first, we present an extension of the properties of quasiconcave bilevel programming (QCBP) problems for the case when three levels exist. Then, by induction on [Formula: see text] (the number of levels), we prove the existence of an extreme point of the polyhedral constraint region that solves the QCMP problem under given conditions. Ultimately, a number of numerical examples are illustrated to verify the results.