FPTAS for mixed-integer polynomial optimization with a fixed number of variables

Details FPTAS for mixed-integer polynomial optimization with a fixed number of variables FPTAS for mixed-integer polynomial optimization with a fixed number of variables

2005-05-31

arxiv.org/abs/math/0505677v1

Mathematics

Optimization and Control

11 pages

Scientific paper

We show the existence of an FPTAS for the problem of maximizing a
non-negative polynomial over mixed-integer sets in convex polytopes, when the
number of variables is fixed.

Affiliated with

Also associated with

No associations

Rating

FPTAS for mixed-integer polynomial optimization with a fixed number of variables 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 FPTAS for mixed-integer polynomial optimization with a fixed number of variables, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and FPTAS for mixed-integer polynomial optimization with a fixed number of variables will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-455717