메뉴 건너뛰기




Volumn 24, Issue 9-10, 2000, Pages 2125-2141

New algorithms for nonlinear generalized disjunctive programming

Author keywords

Branch and bound; Generalized disjunctive programming; Mixed integer nonlinear programming; Nonlinear convex hull

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; INTEGER PROGRAMMING;

EID: 0034307282     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0098-1354(00)00581-0     Document Type: Article
Times cited : (217)

References (22)
  • 8
    • 0003077343 scopus 로고    scopus 로고
    • Mixed-integer nonlinear programming: A survey of algorithms and applications
    • A. Biegler, et al., Large-scale optimization with applications, part II: Optimal design and control. Berlin: Springer-Verlag
    • (1997) , pp. 73-100
    • Grossmann, I.E.1    Kravanja, Z.2
  • 11
    • 0007861980 scopus 로고    scopus 로고
    • Generalized disjunctive programming: Nonlinear convex hull relaxation and algorithms, submitted to Mathematical Programming
    • (1999)
    • Lee, S.1    Grossmann, I.E.2
  • 12
    • 0007861982 scopus 로고    scopus 로고
    • Integrating SQP and branch-and-bound for mixed integer nonlinear programming, submitted to Computational Optimization and Applications
    • (1999)
    • Leyffer, S.1
  • 16
    • 0007758051 scopus 로고
    • Optimization models for design and operation of chemical batch processes, PhD thesis
    • (1995)
    • Ravemark, E.1
  • 21
    • 0007811414 scopus 로고
    • Model building in mathematical programming. New York: Wiley
    • (1985) , pp. 1985
    • Williams, H.P.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.