Practical Management Science
6th Edition
ISBN: 9781337406659
Author: WINSTON, Wayne L.
Publisher: Cengage,
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 6.5, Problem 26P
Summary Introduction
To determine: The optimal solution.
Introduction: The variation between the present value of the
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
You are given the tableau shown in Table 74 for amaximization problem. Give conditions on the unknowns a1, a2, a3, b, and c that make the following statements true:
a The current solution is optimal.
b The current solution is optimal, and there are alternativeoptimal solutions.
c The LP is unbounded (in this part, assume that b0).
Find the optimal solution for the following problem. (Round your answers to 3 decimal places.)
Minimize C =
14x + 7y + 8z
subject to
6x + 12y + 19z ≥ 64
17x + 24y + 9z ≥ 128
and
x ≥ 0, y ≥ 0, z ≥ 0.
What is the optimal value of x?
What is the optimal value of y?
What is the optimal value of z?
What is the minimum value of the objective function?
Please help with correct answers in details: step by step
Q1 The optimal solution of this linear programming problem is at the intersection of constraints 1 and 2.
Max 3x1 + x2
s.t.
4x1 + x2
≤
400
4x1 + 3x2
≤
600
x1 + 2x2
≤
300
x1, x2
≥
0
Over what range can the coefficient of x1 vary before the current solution is no longer optimal? (Round your answers to two decimal places.)
______ to ______?
Over what range can the coefficient of x2 vary before the current solution is no longer optimal? (Round your answers to two decimal places.)
_______ to _______?
Compute the dual value for the first constraint.
_______
Compute the dual value for the second constraint.
_______
Compute the dual value for the third constraint.
_______
Chapter 6 Solutions
Practical Management Science
Ch. 6.3 - Prob. 1PCh. 6.3 - Prob. 2PCh. 6.3 - Solve Problem 1 with the extra assumption that the...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.3 - Prob. 10P
Ch. 6.4 - Prob. 11PCh. 6.4 - Prob. 12PCh. 6.4 - Prob. 13PCh. 6.4 - Prob. 14PCh. 6.4 - Prob. 15PCh. 6.4 - Prob. 16PCh. 6.4 - Prob. 17PCh. 6.4 - Prob. 18PCh. 6.4 - Prob. 19PCh. 6.4 - Prob. 20PCh. 6.4 - Prob. 21PCh. 6.4 - Prob. 22PCh. 6.4 - Prob. 23PCh. 6.5 - Prob. 24PCh. 6.5 - Prob. 25PCh. 6.5 - Prob. 26PCh. 6.5 - Prob. 28PCh. 6.5 - Prob. 29PCh. 6.5 - Prob. 30PCh. 6.5 - In the optimal solution to the Green Grass...Ch. 6.5 - Prob. 32PCh. 6.5 - Prob. 33PCh. 6.5 - Prob. 34PCh. 6.5 - Prob. 35PCh. 6.6 - Prob. 36PCh. 6.6 - Prob. 37PCh. 6.6 - Prob. 38PCh. 6 - Prob. 39PCh. 6 - Prob. 40PCh. 6 - Prob. 41PCh. 6 - Prob. 42PCh. 6 - Prob. 43PCh. 6 - Prob. 44PCh. 6 - Prob. 45PCh. 6 - Prob. 46PCh. 6 - Prob. 47PCh. 6 - Prob. 48PCh. 6 - Prob. 49PCh. 6 - Prob. 50PCh. 6 - Prob. 51PCh. 6 - Prob. 52PCh. 6 - Prob. 53PCh. 6 - Prob. 54PCh. 6 - Prob. 55PCh. 6 - Prob. 56PCh. 6 - Prob. 57PCh. 6 - Prob. 58PCh. 6 - Prob. 59PCh. 6 - Prob. 60PCh. 6 - Prob. 61PCh. 6 - Prob. 62PCh. 6 - Prob. 63PCh. 6 - Prob. 64PCh. 6 - Prob. 65PCh. 6 - Prob. 66PCh. 6 - Prob. 67PCh. 6 - Prob. 68PCh. 6 - Prob. 69PCh. 6 - Prob. 70PCh. 6 - Prob. 71PCh. 6 - Prob. 72PCh. 6 - Prob. 73PCh. 6 - Prob. 74PCh. 6 - Prob. 75PCh. 6 - Prob. 76PCh. 6 - Prob. 77PCh. 6 - Prob. 78PCh. 6 - Prob. 79PCh. 6 - Prob. 80PCh. 6 - Prob. 81PCh. 6 - Prob. 82PCh. 6 - Prob. 83PCh. 6 - Prob. 84PCh. 6 - Prob. 85PCh. 6 - Prob. 86PCh. 6 - Prob. 87PCh. 6 - Prob. 88PCh. 6 - Prob. 89PCh. 6 - Prob. 90PCh. 6 - Prob. 91PCh. 6 - Prob. 92PCh. 6 - This problem is based on Motorolas online method...Ch. 6 - Prob. 94PCh. 6 - Prob. 95PCh. 6 - Prob. 96PCh. 6 - Prob. 97PCh. 6 - Prob. 98PCh. 6 - Prob. 99PCh. 6 - Prob. 100PCh. 6 - Prob. 1CCh. 6 - Prob. 2CCh. 6 - Prob. 3.1CCh. 6 - Prob. 3.2CCh. 6 - Prob. 3.3CCh. 6 - Prob. 3.4CCh. 6 - Prob. 3.5CCh. 6 - Prob. 3.6C
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, operations-management and related others by exploring similar questions and additional content below.Similar questions
- This problem is based on Motorolas online method for choosing suppliers. Suppose Motorola solicits bids from five suppliers for eight products. The list price for each product and the quantity of each product that Motorola needs to purchase during the next year are listed in the file P06_93.xlsx. Each supplier has submitted the percentage discount it will offer on each product. These percentages are also listed in the file. For example, supplier 1 offers a 7% discount on product 1 and a 30% discount on product 2. The following considerations also apply: There is an administrative cost of 5000 associated with setting up a suppliers account. For example, if Motorola uses three suppliers, it incurs an administrative cost of 15,000. To ensure reliability, no supplier can supply more than 80% of Motorolas demand for any product. A supplier must supply an integer amount of each product it supplies. Develop a linear integer model to help Motorola minimize the sum of its purchase and administrative costs.arrow_forwardThe standard form of the following linear programming model is given. Find the values of variables at the point of intersection of constraint 1 and the vertical axis (y). (Round your answers to 3 decimal places.) Maximize P = 30x + 15y + 0s1 + 0s2 subject to 6x + 12y + s1 = 19 13x + 12y + s2 = 35 and x, y, s1, s2≥ 0.arrow_forwardFind the optimal solution for the following problem. (Round your answers to 3 decimal places.) Maximize C = 14x + 13y + 5z subject to 9x + 11y + 18z ≤ 61 14x + 15y + 12z ≤ 122 and x ≥ 0, y ≥ 0, z ≥ 0. What is the optimal value of x? What is the optimal value of y? What is the optimal value of z? What is the maximum value of the objective function?arrow_forward
- Given the following LP: Min 4x1 + 6x2 s.t 2x1 + 2x2 ≥ 3, x1 + 3x2 ≥ 2, x1 + 3x2 ≥ 0, Find its dual LP. Use graphical method or the Simplex algorithm, solve the primal LP in (1). Use graphical method or the Simplex algorithm, solve the dual LP (that you find in Part A). Find its dual LP.arrow_forwardUsing Excel Solve the following LP Maximize $4x + $5y Subject to 2x + 3y ≤ 20 (labor, in hours) 6x + 6y ≤ 36 (materials, in pounds) 4x + 4y ≤ 40 (storage, in square feet) x, y ≥ 0 a) Write the original optimal solution and objective function value. b) What is the optimal solution and objective function value if you acquire 2 additional pounds of material? c) What is the optimal solution and objective function value if you acquire 1.5 additional hours of labor?arrow_forwardSolve these problems using graphical linear programming and answer the questions that follow. Usesimultaneous equations to determine the optimal values of the decision variables.a. Maximize Z = 4x1 + 3x2Subject toMaterial 6x1 + 4x2 ≤ 48 lbLabor 4x1 + 8x2 ≤ 80 hrx1, x2 ≥ 0 b. Maximize Z = 2x1 + 10x2Subject toDurability 10x1 + 4x2 ≥ 40 wkStrength 1x1 + 6x2 ≥ 24 psi Time 1x1 + 2x2 ≤ 14 hrx1, x2 ≥ 0 c. Maximize Z = 6A + 3B (revenue)Subject toMaterial 20A+ 6B ≤ 600 lbMachinery 25A+ 20B ≤ 1,000 hr Labor 20A+ 30B ≤ 1,200 hrA, B ≥ 0 (1) What are the optimal values of the decision variables and Z?arrow_forward
- Given this linear programming model, solve the model and then answer the questions that follow.Maximize Z = 12x1 + 18x2 + 15x3 where x1 = the quantity of product 1 to make, etc.Subject toMachine 5x1 + 4x2 + 3x3 ≤ 160 minutes Labor 4x1 + 10x2 + 4x3 ≤ 288 hoursMaterials 2x1 + 2x2 + 4x3 ≤ 200 poundsProduct 2 x2 ≤ 16 units x1, x2, x3 ≥ 0 a. Are any constraints binding? If so, which one(s)?arrow_forwardThe optimal solution of this linear programming problem is at the intersection of constraints 1 and 2. Max 6x1 + 3x2 s.t. 4x1 + x2 ≤ 400 4x1 + 3x2 ≤ 600 x1 + 2x2 ≤ 300 x1, x2 ≥ 0 (a) Over what range can the coefficient of x1 vary before the current solution is no longer optimal? (Round your answers to two decimal places.) ------ to -------- (b) Over what range can the coefficient of x2 vary before the current solution is no longer optimal? (Round your answers to two decimal places.) ----- to -------- (c) Compute the dual value for the first constraint, second constraint & third constraintarrow_forwardFind the optimal solution for the following problem. (Round your answers to 3 decimal places.) Minimize C = 8x + 8y subject to 7x + 9y ≥ 16 10x + 10y ≥ 22 and x ≥ 0, y ≥ 0. What is the optimal value of x? What is the optimal value of y? What is the minimum value of the objective function?arrow_forward
- Find the optimal solution for the following problem. Maximize C = 4x + 12y subject to 3x + 5y ≤ 12 6x + 2y ≤ 10 and x ≥ 0, y ≥ 0. What is the optimal value of x? What is the optimal value of y? (Round your answer to 3 decimal places.) What is the maximum value of the objective function? (Round your answer to 3 decimal places.)arrow_forwardConsider the following LP model in standard form, with a row for the objective function Z. a) Put it into Canonical form ( or Simplex Tableau form) with basic variables X1, X2 , and X3. b) Determine the association BFS (Basic Feasible Solution) and the new formula for the objective function Z Minimize 10X1 + 4X2 Sujbject to 3X1 + 2X2 - X3 = 60 7X1 + 2X2 - X4 = 84 3X1 + 6X2 -X5 = 72 X1, X2, X3 , X4 , X5 >= 0arrow_forwardI will need the excel "solver" solution to be able to solve. #4) Solve the following LP Maximize $5x + $6y Subject to 2x + 3y ≤ 10 (labor, in hours) 6x + 6y ≤ 36 (materials, in pounds) 7x + 5y ≤ 40 (storage, in square feet) x, y ≥ 0 a) Write the original optimal solution and objective function value. b) What is the optimal solution and objective function value if you acquire 2 additional pounds of material? c) What is the optimal solution and objective function value if you acquire 1.5 additional hours of labor? d) What is the optimal solution and objective function value if you give up 1 hour of labor and get 1.5 pounds of material? e) What is the optimal solution and objective function value if you introduce a new product that has a profit contribution of $2? Each unit of this product will use 1 hour of labor, 1 pound of material, and 2 square feet of storage space.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,