NP-hardness of linear multiplicative programming and related problems |
| |
| Authors: | T. Matsui |
| |
| Affiliation: | (1) Department of Mathematical Engineering and Information Physics, Faculty of Engineering, University of Tokyo, Bunkyo-ku, 113 Tokyo, Japan |
| |
| Abstract: | The linear multiplicative programming problem minimizes a product of two (positive) variables subject to linear inequality constraints. In this paper, we show NP-hardness of linear multiplicative programming problems and related problems. |
| |
| Keywords: | NP-hard minimization of products linear multiplicative programming linear fractional programming multi-ratio programming |
| 本文献已被 SpringerLink 等数据库收录！ |
|
