Convex programming for disjunctive convex optimization

Mathematical Programming, Series B

Volumn 86, Issue 3, 1999, Pages 595-614

  Ceria, Sebastián ^a   Soares, João ^b  

^a Howard Hughes Medical Institute   (United States)

^b UNIVERSITY OF COIMBRA   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0007861073     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050106     Document Type: Article

References (13)

1. Balas, E. (1975): Disjunctive programming: cutting planes from logical conditions. In: Nonlinear Programming 2, pp. 279-312
2. Balas, E. (1985): Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Algebraic Discrete Methods 6, 466-486
3. Bienstock, D. (1996): Computational study of a family of mixed-integer quadratic programming problems. Math. Program. 74, 121-140
4. Burke, J., Ferris, M. (1991): Characterization of solution sets of convex programs. Oper. Res. Lett. 10, 57-60
5. Butera, G. (1997): The solution of a class of limited diversification portfolio selection problems. PhD thesis. Department of Computational and Applied Mathematics, Rice University, Houston, Texas, May 1997
6. Duran, M., Grossmann, I. (1986): An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36, 307-339
7. Hiriart-Urruty, J., Lemaréchal, C. (1993): Convex Analysis and Minimization Algorithms, Vol. 1. Springer-Verlag, Berlin Heidelberg New York
8. Hiriart-Urruty, J., Lemaréchal, C. (1993): Convex Analysis and Minimization Algorithms, Vol. 2. Springer-Verlag, Berlin Heidelberg New York
9. Jeroslow, R. (1977): Representability in mixed integer programming, I: Characterization results. Discrete Appl. Math. 17, 223-243
10. Lemaréchal, C. (1997): Geometric characterization of the subdifferential of a perspective function at points (0, x). Private Communication, May 1997
11. Mangasarian, O. (1988): A simple characterization of solution sets of convex programs. Oper. Res. Lett. 7, 21-26
12. Sherali, H., Shetty, C. (1980): Optimization with disjunctive constraints. In: Beckman, M., Kunzi, H., eds., Lect. Notes Econ. Math. Systems 181. Springer-Verlag, Berlin Heidelberg New York
13. Stubbs, R., Mehrotra, S. (1996): A branch-and-cut method for 0-1 mixed convex programming. Technical Report 96-01, Northwestern University, Evanston, Illinois, Jan 1996