Duality gap of the knapsack problem

Reference no: EM131121874

(Duality Gap of the Knapsack Problem) Given objects i = 1,...,n with positive weights wi and values vi, we want to assemble a subset of the objects so that the sum of the weights of the subset does not exceed a given T > 0, and the sum of the values of the subset is maximized. This is the knapsack problem, which is a special case of a generalized assignment problem

so that the relative value of the duality gap tends to 0 as k → ∞. Note: This exercise illustrates a generic property of many separable problems with integer constraints: as the number of variables increases, the duality gap decreases in relative terms (see Bertsekas [1982], Section 5.5, or Bertsekas [1995b], Section 5.1, for an analysis and a geometrical interpretation of this phenomenon).

Reference no: EM131121874

Questions Cloud

A convergent variation of the sub gradient method : A Convergent Variation of the Sub gradient Method) This exercise provides a convergence result for a common variation of the subgradient method (the result is due to Brannlund [1993]; see also Goffin and Kiwiel [1996]).

How does project align with the business strategy or goal : what is the problem that the project will solve? How does the project align with the business strategy or goals? what is the defined scope and what is not included in the scope of the project?

Convergence of the subgradient method : (Convergence of the Subgradient Method) Consider the subgradient methodand q∗ is the optimal dual cost (this stepsize requires knowledge of q∗, which is very restrictive, but the following Exercise 10.37 removes this restriction).

Trademark dilution by blurring occurs when : Trademark dilution by blurring occurs when. Alvin is an independent computer programmer. He wrote some software for the Rasco, Inc. (Rasco) and was paid for the work. Later, Alvin decided that he would use this program as part of some software he was..

Duality gap of the knapsack problem : (Duality Gap of the Knapsack Problem) Given objects i = 1,...,n with positive weights wi and values vi, we want to assemble a subset of the objects so that the sum of the weights of the subset does not exceed a given T > 0, and the sum of the valu..

Determine eoq for shoelaces annual inventory costs of policy : Annual inventory carrying costs average 15 percent of the inventory value. Assuming that the shoelace manufacturer is located nearby and that orders are filled on the same day they are placed (that is, virtually instantaneously), determine the follow..

Under the current manufacturing process : Under the current manufacturing process, the proportion of computer chips that are defective is 0.4 and a new process is claimed to reduce that proportion. It is desired to test this claim statistically. n = 20, and X defined there.

Constraint relaxation and lagrangian relaxation : (Constraint Relaxation and Lagrangian Relaxation) The purpose of this exercise is to compare the lower bounds obtained by relaxing integer constraints and by dualizing the side constraints. Consider the nonlinear network optimization problem with ..

Determine the amount of accumulated depreciation : Which depreciation method (MACRS or optional straight-line) would minimize net income for income tax reporting for the 3-year period ending December 31, 2011? Determine the amount of accumulated depreciation at December 31, 2011. Ignore present value..

User Account

All Pages