Back to Search
Start Over
Complexity Results for Some Global Optimization Problems.
- Source :
- Journal of Optimization Theory & Applications; Jan2009, Vol. 140 Issue 1, p93-102, 10p
- Publication Year :
- 2009
-
Abstract
- We discuss the complexity of a class of highly structured global optimization problems, namely the maximization of separable functions, with each one-dimensional component convex and nondecreasing, over polytopes defined by a 0-1 constraint matrix with at most two variables involved in each constraint. In particular, we prove some inapproximability and approximability results. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00223239
- Volume :
- 140
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- Journal of Optimization Theory & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 35996814
- Full Text :
- https://doi.org/10.1007/s10957-008-9448-5