Student Suite Cd-rom For Winston's Operations Research: Applications And Algorithms
Student Suite Cd-rom For Winston's Operations Research: Applications And Algorithms
4th Edition
ISBN: 9780534423551
Author: Wayne L. Winston
Publisher: Cengage Learning
Expert Solution & Answer
Book Icon
Chapter 6.10, Problem 1P

a.

Explanation of Solution

Dual of the Glassco problem:

  • The primal of the Glassco problem is as follows,

  max z=6x1+10x2+9x3+20x4

  • The above function subject to the following constraints,

  4x1+9x2+7x3+10x4200(ConstraintonMolding)x1+x2+3x3+40x4400(ConstraintonPackaging)3x1+4x2+2x3+x4500(ConstraintonGlass)

  • The optimal solution to this problem is as follows,

  z=28003x1=4003x2=0x3=0x4=203s1=s2=0s3=2803

  • To find the dual of the problem consider the below table,
   max z   
min w x10x20x30x40 
  x1x2x3x4 
y10

b.

Explanation of Solution

Optimal solution to the dual of the Glassco problem:

  • y3=0” because the value of “s3” is greater than “0”.
  • The constraint (1) is binding because “x1” is greater than “0”.
  • The constraint (4) is binding because “x4” is greater than “0”.
  • Solving the constraint (1) and (4) simultaneously produces “y1=2215”, , and “y2=215”.
  • Substitute the values of “y1”,“y2”, and set the value of “y3” as “0” in equation “w=600y</

c.

Explanation of Solution

Example of complementary slackness condition:

Condition:

If “ithprimalslack>0”, then “ithdualvariable=0”.

  • s3>0” denotes “y3=0”.
  • This is fair, because an additional ounce of glass will not increase “z”, if all available glass is not being used.
  • Therefore, the constraint on glass should contain the shadow price of “0”.

Condition:

If “ithdualvariable>0”, then “ithprimalslack=0”.

  • y2>0” denotes “s2=0”.
  • An extra minute of packaging time will increase “Z”, because “y2” is greater than “0”.
  • Therefore, all currently available packaging time should be used.

Condition:

If “jthdual excess>0”, then “jthprimalvariable=0”.

  • e2>0” denotes “x2=0”.
  • It is denoted by the following dual problem constraint,

9y1+y2+4y310

  • From this constraint, subtract the excess variable “e2” as follows,

9y1+y2+4y3e2=10e2=9y1+y2+4y310

Blurred answer
Students have asked these similar questions
Need help making python code for this!
2.7 LAB: Smallest of two numbers Instructor note: Note: this section of your textbook contains activities that you will complete for points. To ensure your work is scored, please access this page from the assignment link provided in the CTU Virtual Campus. If you did not access this page via the CTU Virtual Campus, please do so now.
I help understanding this question d'y + 4dy +3y = a, Initial Conditions: y(0) = 5 & y'(0)=0 Where a = 10 a) Find y(t) =yh(t) +yp(t) in time domainIs the system over-damped, under-damped, or critical? b) Find y(t) using Laplace Transforms

Chapter 6 Solutions

Student Suite Cd-rom For Winston's Operations Research: Applications And Algorithms

Ch. 6.3 - Prob. 4PCh. 6.3 - Prob. 5PCh. 6.3 - Prob. 6PCh. 6.3 - Prob. 7PCh. 6.3 - Prob. 8PCh. 6.3 - Prob. 9PCh. 6.4 - Prob. 1PCh. 6.4 - Prob. 2PCh. 6.4 - Prob. 3PCh. 6.4 - Prob. 4PCh. 6.4 - Prob. 5PCh. 6.4 - Prob. 6PCh. 6.4 - Prob. 7PCh. 6.4 - Prob. 8PCh. 6.4 - Prob. 9PCh. 6.4 - Prob. 10PCh. 6.4 - Prob. 11PCh. 6.4 - Prob. 12PCh. 6.4 - Prob. 13PCh. 6.5 - Prob. 1PCh. 6.5 - Find the duals of the following LPs: Ch. 6.5 - Prob. 3PCh. 6.5 - Prob. 4PCh. 6.5 - Prob. 5PCh. 6.5 - Prob. 6PCh. 6.6 - Prob. 1PCh. 6.6 - Prob. 2PCh. 6.7 - Prob. 1PCh. 6.7 - Prob. 2PCh. 6.7 - Prob. 3PCh. 6.7 - Prob. 4PCh. 6.7 - Prob. 5PCh. 6.7 - Prob. 6PCh. 6.7 - Prob. 7PCh. 6.7 - Prob. 8PCh. 6.7 - Prob. 9PCh. 6.8 - Prob. 1PCh. 6.8 - Prob. 2PCh. 6.8 - Prob. 3PCh. 6.8 - Prob. 4PCh. 6.8 - Prob. 5PCh. 6.8 - Prob. 6PCh. 6.8 - Prob. 8PCh. 6.8 - Prob. 9PCh. 6.8 - Prob. 10PCh. 6.8 - Prob. 11PCh. 6.9 - Prob. 1PCh. 6.9 - Prob. 2PCh. 6.9 - Prob. 3PCh. 6.10 - Prob. 1PCh. 6.10 - Prob. 2PCh. 6.10 - Prob. 3PCh. 6.11 - Prob. 1PCh. 6.11 - Prob. 3PCh. 6.11 - Prob. 4PCh. 6.12 - Prob. 5PCh. 6.12 - Prob. 6PCh. 6.12 - Prob. 7PCh. 6 - Prob. 1RPCh. 6 - Prob. 2RPCh. 6 - Prob. 3RPCh. 6 - Prob. 4RPCh. 6 - Prob. 5RPCh. 6 - Prob. 6RPCh. 6 - Prob. 7RPCh. 6 - Prob. 8RPCh. 6 - Prob. 9RPCh. 6 - Prob. 10RPCh. 6 - Prob. 11RPCh. 6 - Prob. 13RPCh. 6 - Prob. 14RPCh. 6 - Prob. 15RPCh. 6 - Prob. 17RPCh. 6 - Prob. 18RPCh. 6 - Prob. 19RPCh. 6 - Prob. 20RPCh. 6 - Prob. 21RPCh. 6 - Prob. 22RPCh. 6 - Prob. 25RPCh. 6 - Prob. 29RPCh. 6 - Prob. 33RPCh. 6 - Prob. 34RPCh. 6 - Prob. 35RPCh. 6 - Prob. 36RPCh. 6 - Prob. 37RP
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole