Cart (Loading....) | Create Account
Close category search window

An approximation algorithm for convex multiplicative programming problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lizhen Shao ; Sch. of Inf. Eng., Univ. of Sci. & Technol., Beijing, China ; Ehrgott, M.

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

Need Help?

IEEE Advancing Technology for Humanity 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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.