NP-Hardness of optimizing the sum of Rational Linear Functions over an Asymptotic-Linear-Program

Preprint English OPEN
Chermakani, Deepak Ponvel;
  • Subject: Computer Science - Computational Complexity | Computer Science - Discrete Mathematics

We convert, within polynomial-time and sequential processing, an NP-Complete Problem into a real-variable problem of minimizing a sum of Rational Linear Functions constrained by an Asymptotic-Linear-Program. The coefficients and constants in the real-variable problem ar... View more
Share - Bookmark