Multiplicative Programming Problems: Analysis and Efficient Point Search Heuristic |
| |
| Authors: | Benson H P Boger G M |
| |
| Institution: | (1) College of Business Administration, University of Florida, Gainesville, Florida;(2) College of Business Administration, University of Florida, Gainesville, Florida |
| |
| Abstract: | Multiplicative programming problems are difficult global optimization problems known to be NP-hard. At the same time, these problems have some important applications in engineering, finance, economics, and other fields. This article has two purposes. The first is to present an analysis that shows several relationships between concave multiplicative programs and concave minimization problems, and between concave multiplicative programs and certain multiple-objective mathematical programs. The second purpose is to propose and report computational results for a heuristic efficient-point search algorithm that we have designed for use on linear multiplicative programming problems. To our knowledge, this is the first heuristic algorithm of its type. The theoretical and algorithmic results given in the article offer some potentially important new avenues for analyzing and solving multiplicative programming problems of various types. |
| |
| Keywords: | Multiplicative programming global optimization concave minimization efficient points heuristic algorithms multiple objectives |
| 本文献已被 SpringerLink 等数据库收录！ |
|
