Purchase Solution

Knapsack Problem : Write in Canonical Form

Not what you're looking for?

Ask 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)

Attachments
Purchase this Solution
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.

Purchase this Solution
Free BrainMass Quizzes
Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

View More Free Quizzes
Related BrainMass Solutions

  • Linear Programming : Maximizing Subject to Constraints and Knapsack Algorithm Problem

    problem has one constraint in addition to the non negativity constraints, and is called knapsack problem.

  • Knapsack Problems

    Compact discs 2 30 Juan wants to determine the combination of items he should pack in his duffel bag that will maximize his profit. The problem is an example of a type of integer programming known as a "knapsack" problem.

  • Parametric Equations : Canonical Form, Values of t

    36159 Parametric Equations : Canonical Form, Values of t Consider the line with parametric equations, x = 2t + 3 and y = -4t + 1 a) Find the equation of the line in non-parametric form.

  • Similarity Classes of 6x6 Polynomials

    Problem #11 We know, each matrix can have its Jordan canonical form over with respect to similarity. So we only consider the Jordan canonical form of a matrix . It has the following Jordan canonical form: , where or is an matrix.

  • Ellipsoid/canonical form

    The canonical form is examined.

  • Rational and Jordan Canonical Forms

    To find the Jordan canonical form of , we set Thus . So the Jordan canonical form of is The rational canonical form is Rational and Jordan Canonical Forms are investigated. The solution is detailed and well presented.

  • Rational canonical form

    Then the rational canonical form of is This shows how to find the rational canonical form for a matrix with given properties.

  • Linear Algebra with Cubic Roots

    Since C is algebraically closed, every n × n matrix over C is similar over C to a matrix in Jordan canonical form. A. Suppose that A is a nilpotent n × n matrix over C, and that there is an integer k, k ≥ n/3, such that Ak 6= 0.

  • Zero-One Programming Problem

    The group must hike several miles through the woods to get to the campsite, and anything that is needed on this trip must be packed in a knapsack and carried to the campsite.

View More Related Solutions