# Knapsack Problem : Write in Canonical Form

Not what you're looking for? Search our solutions OR ask your own Custom question.

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)

Â© BrainMass Inc. brainmass.com March 4, 2021, 6:13 pm ad1c9bdddfhttps://brainmass.com/math/computing-values-of-functions/knapsack-problem-write-canonical-form-35351

#### Solution Summary

A knapsack problem is solved. The solution is detailed and well presented. The response received a rating of "5" from the student who originally posted the question.

$2.49