Operations Research : Applications and Algorithms
Operations Research : Applications and Algorithms
4th Edition
ISBN: 9780534380588
Author: Wayne L. Winston
Publisher: Brooks Cole
bartleby

Concept explainers

Expert Solution & Answer
Book Icon
Chapter 6, Problem 1RP

a.

Explanation of Solution

Dual linear problem and its optimal solution

  • The dual of a given linear program is another linear program that is derived from the original linear program in following ways:
    • Each variable in the original linear program becomes a constraint in the dual linear program.
    • Each constraint in the original linear program becomes a variable in the dual linear program.
    • The objective direction is inversed which becomes maximum in the original and minimum in the dual.
  • Hence the dual of the linear problem is

    Min w = 6y1+ 3y2+ 10y3

    Subject to

    y1+ y2+ 2y3>= 42y1– y2+ y3>= 1

  • The formulas for computing the optimal table include:
    • xj column in optimal table’s constraints = B-1aj
    • Right hand side of optimal table’s constraints = B-1b
    • Coefficient of slack variable in row 0 = (ith element of cBVB-1).
    • Coefficient of excess variable in row 0 = -(ith element of cBVB-1) .
    • Coefficient of artificial variable in row 0 = (ith element of cBVB-1) + M (max problem).
    • Right hand side of row 0 = cBVB-1b
  • Hence the optimal solution is

    w = 58/3, y1= -2/3, y2= 0, y3= 7/3

b.

Explanation of Solution

New Optimal solution

  • For a maximization problem, the new optimal value = (old optimal value) + (Constraint i’s shadow price).
  • For a minimization problem, the new optimal value = (old optimal value) – (Constraint i’s shadow price).
  • Here the new optimal value = 58/3 + row 3 shadow price = 65/3.

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
Ridgley Custom Metal Products (RCMP) must purchase a new tube bender. RCMP's MARR is 12 percent. RCMP can forecast demand for its products for only 4 years in advance. The salvage value after 4 years is $50,000 for model T, $85,000 for model A and $75,000 for model X. Using the study period method, which of the three alternatives is best? Salvage Value $50.000 Yearly Net Savings $55.000 $50.000 $65.000 Model First Cost Economic Life $100,000 $140,000 $190,000 4 years 4 years A $85,000 $75,000 4 years Click the icon to view the table of compound interest factors for discrete compounding periods when i= 12%. The present worth of Model T is $. The present worth of Model A is $ The present worth of Model X is $. Model V is the better choice to buy. (Round to the nearest cent as needed.)
Andalus Furniture Company has two manufacturing plants, one at Aynor and another at Spartanburg. The cost in dollars of producing a kitchen chair at each of the two plants is given here. Aynor: Cost = 65Q1 + 5Q12 + 96Spartanburg: Cost = 21Q2 + 3Q22 + 147   Where     Q1 = number of chairs produced at Aynor   Q2= number of chairs produced at Spartanburg Andalus needs to manufacture a total of 50 kitchen chairs to meet an order just received. How many chairs should be made at Aynor and how many should be made at Spartanburg in order to minimize total production cost? Can you use Excel to formulate and Solver to solve.
The Callaghan family owns 410 acres of farmland in Co. Cork on which they grow wheat and oats. Each acre of wheat costs €105 to plant, cultivate, and harvest; each acre of oats costs €210. The Bradleys have a budget of €52,500 for next year. The government limits the number of acres of oats that can be planted to 100. The profit from each acre of wheat is €300; the profit from each acre of oats is €520. The Callaghans want to know how many acres of each crop to plant in order to maximize their profit. ii. Formulate a linear programming model for this problem.

Chapter 6 Solutions

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
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
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