Knapsack Problem : Write in Canonical Form

Let [EQUATION1] with [EQUATION2] and [EQUATION3]. The idea is to write each such set in some simple canonical form.

(i) When n = 2, how many distinct knapsack sets are there? Write them out in a canonical form with integral coefficients and 1 = [EQUATION4].
(ii) Repeat for n = 3 with [EQUATION5].

*(For proper equations and complete problem, please see the attachment)

Attached file(s):

exercise sheet 6 question 2.doc  View File