Intractability of approximate multi-dimensional nonlinear optimization on independence systems

Details Intractability of approximate multi-dimensional nonlinear optimization on independence systems Intractability of approximate multi-dimensional nonlinear optimization on independence systems

2010-01-28

arxiv.org/abs/1001.5056v1

Discrete Mathematics, 311:780--783, 2011

Mathematics

Optimization and Control

Scientific paper

We consider optimization of nonlinear objective functions that balance $d$ linear criteria over $n$-element independence systems presented by linear-optimization oracles. For $d=1$, we have previously shown that an $r$-best approximate solution can be found in polynomial time. Here, using an extended Erd\H{o}s-Ko-Rado theorem of Frankl, we show that for $d=2$, finding a $\rho n$-best solution requires exponential time.

Affiliated with

Also associated with

No associations

Rating

Intractability of approximate multi-dimensional nonlinear optimization on independence systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Intractability of approximate multi-dimensional nonlinear optimization on independence systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Intractability of approximate multi-dimensional nonlinear optimization on independence systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-253840