5.1.7 (Duality Gap of the Knapsack Problem) www

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter2: Introduction To Spreadsheet Modeling
Section: Chapter Questions
Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...
icon
Related questions
Question
5.1.7 (Duality Gap of the Knapsack Problem)
www
Given objects i = 1,... , n with positive weights w; 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 A > 0, and the sum of the values of the subset is maximized.
%3D
(a) Show that this problem can be written as
maximize >
i=1
subject to > Wit; < A,
Σ
xi E {0,1}, i = 1,..., n.
i=1
(b) Use a graphical procedure to solve the dual problem where a Lagrange
multiplier is assigned to the constraint , w;X; < A.
(c) Let f* and q* be the optimal values of the primal and dual problems,
respectively. Show that
0 < q* – f* < max vi.
|
i=1,...,n
(d) Consider the problem where A is multiplied by a positive integer k and
each object is replaced by k replicas of itself, while the object weights and
values stay the same. Let f* (k) and q*(k) be the corresponding optimal
primal and dual values. Show that
q*(k) - f*(k)
f* (k)
1 maxi=1,...,n Vi
f*
k
so that the relative value of the duality gap tends to 0 as k o.
Transcribed Image Text:5.1.7 (Duality Gap of the Knapsack Problem) www Given objects i = 1,... , n with positive weights w; 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 A > 0, and the sum of the values of the subset is maximized. %3D (a) Show that this problem can be written as maximize > i=1 subject to > Wit; < A, Σ xi E {0,1}, i = 1,..., n. i=1 (b) Use a graphical procedure to solve the dual problem where a Lagrange multiplier is assigned to the constraint , w;X; < A. (c) Let f* and q* be the optimal values of the primal and dual problems, respectively. Show that 0 < q* – f* < max vi. | i=1,...,n (d) Consider the problem where A is multiplied by a positive integer k and each object is replaced by k replicas of itself, while the object weights and values stay the same. Let f* (k) and q*(k) be the corresponding optimal primal and dual values. Show that q*(k) - f*(k) f* (k) 1 maxi=1,...,n Vi f* k so that the relative value of the duality gap tends to 0 as k o.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
Operations Management
Operations Management
Operations Management
ISBN:
9781259667473
Author:
William J Stevenson
Publisher:
McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi…
Operations and Supply Chain Management (Mcgraw-hi…
Operations Management
ISBN:
9781259666100
Author:
F. Robert Jacobs, Richard B Chase
Publisher:
McGraw-Hill Education
Business in Action
Business in Action
Operations Management
ISBN:
9780135198100
Author:
BOVEE
Publisher:
PEARSON CO
Purchasing and Supply Chain Management
Purchasing and Supply Chain Management
Operations Management
ISBN:
9781285869681
Author:
Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:
Cengage Learning
Production and Operations Analysis, Seventh Editi…
Production and Operations Analysis, Seventh Editi…
Operations Management
ISBN:
9781478623069
Author:
Steven Nahmias, Tava Lennon Olsen
Publisher:
Waveland Press, Inc.