A unified branch-and-bound and cutting plane algorithm for a class of nonconvex optimization problems : application to bilinear programming


Muu, Lê D. ; Oettli, Werner


[img]
Preview
PDF
1988_88.pdf - Published

Download (382kB)

URL: http://ub-madoc.bib.uni-mannheim.de/1974
URN: urn:nbn:de:bsz:180-madoc-19743
Document Type: Working paper
Year of publication: 1988
Publication language: English
Institution: School of Business Informatics and Mathematics > Sonstige - Fakultät für Mathematik und Informatik
MADOC publication series: Veröffentlichungen der Fakultät für Mathematik und Informatik > Institut für Mathematik > Mannheimer Manuskripte
Subject: 510 Mathematics
Subject headings (SWD): Branch-and-Bound-Methode , Schnittebenenverfahren
Abstract: A unifled approach to branch-and-bound and cutting plane methods for solving a certain class of nonconvex optimization problems is proposed. Based on this approach an implementable algorithm is obtained for programming problems with a bilinear objective function and jointly convex constraints.
Additional information:

Das Dokument wird vom Publikationsserver der Universitätsbibliothek Mannheim bereitgestellt.




+ Citation Example and Export

Muu, Lê D. ; Oettli, Werner (1988) A unified branch-and-bound and cutting plane algorithm for a class of nonconvex optimization problems : application to bilinear programming. Open Access [Working paper]
[img]
Preview


+ Search Authors in

+ Download Statistics

Downloads per month over past year

View more statistics



You have found an error? Please let us know about your desired correction here: E-Mail


Actions (login required)

Show item Show item