Referenced Items are not available for this document.
Multiplicative programming problems are difficult global optimization problems known to be NP-hard. In this paper we propose a method for approximately solving convex multiplicative programming problems. This work is based on our previous work “An approximation algorithm for convex multiobjective programming problems”. We show, by slightly changing the algorithm, that our method can be used to solve convex multiplicative programming problems. We provide an example that shows that our method has computational advantage compared with Benson's outcome space branch and bound outer approximation algorithm.
Published in:
Computational Intelligence in Multicriteria Decision-Making (MDCM), 2011 IEEE Symposium on
Date of Conference: 11-15 April 2011
- Page(s):
- 175 - 181
- Print ISBN:
- 978-1-61284-068-0
- INSPEC Accession Number:
- 12110455
- Conference Location :
- Paris
- Digital Object Identifier :
- 10.1109/SMDCM.2011.5949275
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
