Q2\ Solve the following linear programming problem by using the simplexmethod:Маx Р 3 Зх + 2x2 + Xзsubject to: 2x + X2+ X3 <1502х1 +2 х +8 х;<2002x1 + 3x2 + X3 320X1, X2 , X320

Given LP- Max P = 3x1+2x2+x3Subject to-2x1+x2+x3≤1502x1+2x2+8x3≤2002x1+3x2+x3≤320x1, x2, x3 ≥0

Answered: Q2\ Solve the following linear…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter7: Nonlinear Optimization Models

Section: Chapter Questions

Problem 73P

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.
Solve Problem 1 with the extra assumption that the investments can be grouped naturally as follows: 14, 58, 912, 1316, and 1720. a. Find the optimal investments when at most one investment from each group can be selected. b. Find the optimal investments when at least one investment from each group must be selected. (If the budget isnt large enough to permit this, increase the budget to a larger value.)
Find the values of x1 and x2 where the following two constraints intersect. (Round your answers to 3 decimal places.) (1) 10x1 + 5x2 ≥ 50 (2) 1x1 + 2x2 ≥ 12
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)?
Solve the following problem after finding its dual. Min z = x1 - 3x2 + 3x3 s.t. 3x1 - x2 + 2 x3 ≤ 7 2x1 + 4x2 ≥ -12 -4x1 + 3x2 + 8x3 ≤ 10 x1, x2, x3 ≥ 0
Solve the following Linear programming problem using the simplex method:Maximize Z = 10X1 + 15X2 + 20X3subject to:2X1 + 4X2 + 6X3 ≤ 243X1 + 9X2 + 6X3 ≤ 30X1, X2 and X3 ≥ 0(b) Suppose X1, X2, X3 in (a) refer to number of red, blue, and green balloons respectivelywhich are produced by a company per day. And Z is the total profit obtained afterselling these balloons. Interpret your answer obtained in (a) above(c) Write the dual of the following linear programming problem:Minimize Z = 2X1 − 3X2 + 4X3subject to:3X1 + 4X2 + 5X3 ≥ 96X1 + X2 + 3X3 ≥ 47X1 − 2X2 − X3 ≤ 105x1 − 2X2 + X3 ≥ 34X1 + 6X2 − 2X3 ≥ 3X1, X2 and X3 ≥ 0
The 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.
Find the indicated maximum or minimum value of the objective function in the linear programming problem. Minimize g = 10x + 6y subject to the following. x + 2y ≥ 10 2x + y ≥ 11 x + y ≥ 9 x ≥ 0, y ≥ 0
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…
Use the simplex method to solve. Maximize z = 4x1 + 2x2, subject to 3x1 + x2 < 22 3x1 + 4x2 < 34 x1 > 0, x2 > 0 x1 = x2 = x3 =
For the products A, B, C, and D, which of the following could be a linear programming objective function? Select one: a. Z = 1A + 2BC + 3D b. Z = 1A + 2AB + 3ABC + 4ABCD c. Z = 1A + 2B + 3C + 4D d. Z = 1A + 2B/C + 3D
We have 60 meters of fence and want to fence a triangular shaped area. Please formulate an NLP (do not try to solve) that will enable us to maximize the fenced area (Hint: The area of a triangle with sides of length a, b, and c is ( s (s – a) (s – b) (s – c))1/2, where s is half the parameter of the triangle).

SEE MORE QUESTIONS

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

Q2\ Solve the following linear programming problem by using the simplex method: Мах Р 3 3х, + 2х, + Xз subject to: 2x1 + X2+ X3 <150 2x1 +2 x2 +8 x3< 200 2x1 + 3x2 + X3 320 X1, X2 , X320