Problem 2 Consider the following problem:max 2x1 + 7r2 + 4r3s.t. I1 + 2x2 +x3 < 10ЗА1 + 372 + 2.т3 < 10I1, 12, X3 > 0.Use the dual of this linear program to demonstrate that the optimal value of this problem cannotexceed 25.

Given- MAX 2x1 + 7x2 + 4x3Subject to-x1+ 2x2+ x3≤103x1+ 3x2+ 2x3 ≤10x1, x2, x3≥0

Answered: Problem 2 Consider the following…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter4: Linear Programming Models

Section: Chapter Questions

Problem 135P

See similar textbooks

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.
Consider the following linear programming model with 4 regular constraints:Maximize 3X + 5Y (a) Draw your graph in the space below:subject to: 4X + 4Y ≤ 48 (constraint #1) 4X + 3Y ≤ 50 (constraint #2) 2X + 1Y ≤ 20 (constraint #3) X ≥ 2 (constraint #4) X, Y ≥ 0 (non-negativity constraints)(a) Which of the constraints is redundant? Constraint #______.Justify by drawing a graph similar to Figure 7.14 on p.263.(b) Is point (9,3) a feasible solution? _____. Explain your answer (by analyzing each of the constraints).Constraint #1: _______________________________________________________________Constraint #2: _______________________________________________________________Constraint #3: _______________________________________________________________Constraint #4: ______________________________________________________________
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 to Machine: 5x 1 + 4x 2 + 3x 3 ≤ 160 minutes Labor: 4x1 + 10x2 + 4x3 ≤ 288 hours Materials: 2x 1 + 2x2 + 4x3 ≤ 200 pounds Product 2: x2 ≤ 16 units x1, x2, x3 ≥ 0 a) Are any constraints binding? If so, which one(s)? b) If the profit on product 3 were changed to $22 a unit, what would the values of the decision variables be? The objective function? Explain. c) If the profit on product 1 were changed to $22 a unit, what would the values of the decision variables be? The objective function? Explain. d) If 10 hours less of labor time were available, what would the values of the decision variables be? The objective function? Explain. e) If the manager decided that as many as 20 units of product 2 could be produced (instead of 16), how much additional profit would be generated? f) If profit per unit on each…
Set up the simplex matrix used to solve the linear programming problem. Assume all variables are nonnegative.Maximize f = 5x + 9y subject to 8x + 5y ≤ 200 x + 6y ≤ 250. x y s1 s2 f first constraint second constraint objective function
Consider the following linear programming problem: MIN Z = 3x1 + 2x2 Subject to: 2x1 + 3x2 ≥ 12 5x1 + 8x2 ≥ 37 x1, x2 ≥ 0 What is minimum cost and the value of x1 and x2 at the optimal solution?
Consider the following constraints from a two-variable Linear Program. (1) X ≥ 0 (2) Y ≥ 0 (3) 5X + 4Y ≤ 50 (4) 5X - 2Y ≤ 20 If constraints (3) and (4) are binding, what is the optimal solution (X, Y)? Answer choices (6, 5) (9, 5) (0, 20) (20, 0)
Consider the following LP problem with two constraints: 18X + 8Y >= 144and 9X + 4Y= 36. The objective function is Min 14X + 30Y . What combination of X and Y will yield the optimum solution for this problem? a. infeasible problem b. unbounded problem c. 0 , 9 d. 4 , 0 e. 2 , 4.5
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)?
Given the following 2 constraints, which solution is a feasible solution for a minimization problem? (1) 7 x1 + 3 x2 ≥ 21 (2) x1 + 3 x2 ≥ 6 Group of answer choices (x1, x2) = (2, 5) (x1, x2) = (1, 2) (x1, x2) = (0, 4) (x1, x2) = (0.5, 5)
4. Consider the following linear programming problem: Maximize Z=$15x + $5y, subject to (1) 2x + y ≤ 10 and (2) 4x + 3y ≤ 24 and (3) x, y ≥ 0. Will the optimal solution change if the objective function becomes Maximize Z=$15x + $20y (constraints remain the same)? Select one: a. Can't determine given the information. b. Yes, it will change. c. No, it remains the same.

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

SEE MORE TEXTBOOKS

Problem 2 Consider the following problem: max 2r1 + 7r2 + 4.r3 s.t. rį + 2x2 +x3 < 10 3x1 + 3r2 + 2rz < 10 I1, T2, 13 > 0. Use the dual of this linear program to demonstrate that the optimal value of this problem cannot exceed 25.