Next: MINIMUM COVERING INTEGER PROGRAMMING Up: Mathematical Programming Previous: MAXIMUM BOUNDED 0-1 PROGRAMMING Index

### MAXIMUM PACKING INTEGER PROGRAMMING

- INSTANCE: Rational m x n-matrix , rational m-vector , rational n-vector .

- SOLUTION: A rational n-vector such that .

- MEASURE: The scalar product of c and x, i.e., .

- Good News: Approximable within for some c>0, where [423].

- Comment: Variation in which and is approximable within
  [423].