본문 바로가기
HOME> 논문 > 논문 검색상세

논문 상세정보

Quasiconcave Bilevel Programming Problem

Arora S.R.    (Department of Mathematics, Hans Raj College, University of Delhi   ); Gaur Anuradha    (Department of Mathematics, Maharaja Agrasen College, University of Delhi  );
  • 초록

    Bilevel programming problem is a two-stage optimization problem where the constraint region of the first level problem is implicitly determined by another optimization problem. In this paper we consider the bilevel quadratic/linear fractional programming problem in which the objective function of the first level is quasiconcave, the objective function of the second level is linear fractional and the feasible region is a convex polyhedron. Considering the relationship between feasible solutions to the problem and bases of the coefficient submatrix associated to variables of the second level, an enumerative algorithm is proposed which finds a global optimum to the problem.


  • 주제어

    Bilevel Programming .   Non-convex Optimization .   Quasiconcave Functions .   Quadratic Programming .   Enumerative Method.  

  • 참고문헌 (16)

    1. Candler, W. and R. J. Townsley, 'A Linear two-level programming problem,' Computers and Operations Research 9 (1982), 59-76 
    2. Majthey, A. and A. Whinston, 'Quasiconcave minimization subject to linear constraints,' Discrete Mathematics 1 (1974), 35-39 
    3. Vicente, L. N. and P. H. Calamai, 'Bilevel and multilevel programming: A bibliography review,' Journal of Global Optimization 5 (1994), 291-306 
    4. Zwart, P. B., 'Global maximization of a convex function with linear inequality constraints', Operations Research 22 (1974), 602-609 
    5. Thoi, N. V. and H. Tuy, 'Convergent algorithms for minimizing a concave function,' Mathematics of Operations Research 5 (1980), 556-566 
    6. Al-Khayyal, F. A., 'Linear quadratic and bilinear programming approaches to linear complementarity problem,' European Journal of Operational Research 24 (1986), 216-227 
    7. Calvete, H. I. and C. Gale, 'On the quasiconcave bilevel programming problem,' Journal of Optimization Theory and Applications 98, 3 (1998), 613-622 
    8. Murty, K. G., 'Solving the fixed charge problem by ranking the extreme points,' Operations Research 16 (1969), 268-279 
    9. Gupta, R. and M. C. Puri, 'Extreme point quadratic fractional programming problem,' Optimization 30 (1994), 205-214 
    10. Cabot, A. and R. L. Francis, 'Solving certain non-convex quadratic minimization problems by ranking the extreme points,' Operations Research 18 (1970), 82-86 
    11. Calvete, H. I. and C. Gale, 'The bilevel linear/linear fractional programming problem,' European Journal of Operational Research 114 (1999), 188-197 
    12. Bard, J. F., 'Optimality conditions for the bilevel programming problem,' Naval Research Logistics Quarterly 31 (1984), 13-26 
    13. Mathur, K. and M. C. Puri, 'On bilevel fractional programming,' Optimization 35 (1995), 215-226 
    14. Falk, J. E. and R. M. Soland, 'An algorithm for solving separable non-convex programming problems,' Management Science 15 (1969), 550-569 
    15. Konno, H. and T. Kuno, 'Linear multiplicative programming,' Mathematical Programming 56 (1992), 51-64 
    16. Rosen, J. B., 'Global minimization of a linearly constrained concave function by partition of feasible domain', Mathematics of Operations Research 8 (1983), 215-230 

 활용도 분석

  • 상세보기

    amChart 영역
  • 원문보기

    amChart 영역

원문보기

무료다운로드
  • NDSL :
  • 한국경영과학회 : 저널
유료다운로드

유료 다운로드의 경우 해당 사이트의 정책에 따라 신규 회원가입, 로그인, 유료 구매 등이 필요할 수 있습니다. 해당 사이트에서 발생하는 귀하의 모든 정보활동은 NDSL의 서비스 정책과 무관합니다.

원문복사신청을 하시면, 일부 해외 인쇄학술지의 경우 외국학술지지원센터(FRIC)에서
무료 원문복사 서비스를 제공합니다.

NDSL에서는 해당 원문을 복사서비스하고 있습니다. 위의 원문복사신청 또는 장바구니 담기를 통하여 원문복사서비스 이용이 가능합니다.

이 논문과 함께 출판된 논문 + 더보기