An algorithm for minimizing a convex-concave function over a convex set

Preview

PDF
1989_92.pdf - Published
Download (199kB)

URL:	http://ub-madoc.bib.uni-mannheim.de/1980
URN:	urn:nbn:de:bsz:180-madoc-19808
Document Type:	Working paper
Year of publication:	1989
The title of a journal, publication series:	None
Publication language:	English
Institution:	School of Business Informatics and Mathematics > Sonstige - Fakultät für Wirtschaftsinformatik und Wirtschaftsmathematik
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 , Minimierung , Konvexe Funktion , Konkave Funktion
Abstract:	A branch-and-bound method is proposed for minimizing a convex-concave function over a convex set. The minimization of a dc-function is a special case, where the subproblems connected with the bounding operation can be solved effectively.
Additional information:

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

BASE: Muu, Lê D. ; Oettli, Werner

Google Scholar: Muu, Lê D. ; Oettli, Werner

Downloads per month over past year

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

Show item