Follow the instructions given, and solve this LP problem using graphical linear programming.Max Z = 6x + 3yS.T.Constraint 1: 20x + 6y <= 600Constraint 2: 25x+ 20y <= 1000Constraint 3: 20x + 30y <= 1200x,y>= 01. Plot all constraint equations on the same graph. Shade the Feasible Region. Identify each cornerpoint x and y by solving it.2. Solve for the decision variables. What is the x? What is the y?3. Solve for the Z.4. Save your work and solution in a pdf file. Submit the file by attaching it.

Objective Functions and Constraints: Based on the given details, the objective…

Answered: Follow the instructions given, and…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter7: Nonlinear Optimization Models

Section: Chapter Questions

Problem 49P: If a monopolist produces q units, she can charge 400 4q dollars per unit. The variable cost is 60...

See similar textbooks

Similar questions

If a monopolist produces q units, she can charge 400 4q dollars per unit. The variable cost is 60 per unit. a. How can the monopolist maximize her profit? b. If the monopolist must pay a sales tax of 5% of the selling price per unit, will she increase or decrease production (relative to the situation with no sales tax)? c. Continuing part b, use SolverTable to see how a change in the sales tax affects the optimal solution. Let the sales tax vary from 0% to 8% in increments of 0.5%.
Lemingtons is trying to determine how many Jean Hudson dresses to order for the spring season. Demand for the dresses is assumed to follow a normal distribution with mean 400 and standard deviation 100. The contract between Jean Hudson and Lemingtons works as follows. At the beginning of the season, Lemingtons reserves x units of capacity. Lemingtons must take delivery for at least 0.8x dresses and can, if desired, take delivery on up to x dresses. Each dress sells for 160 and Hudson charges 50 per dress. If Lemingtons does not take delivery on all x dresses, it owes Hudson a 5 penalty for each unit of reserved capacity that is unused. For example, if Lemingtons orders 450 dresses and demand is for 400 dresses, Lemingtons will receive 400 dresses and owe Jean 400(50) + 50(5). How many units of capacity should Lemingtons reserve to maximize its expected profit?
Use the simplex method to find the optimal solution. Assume all variables are nonnegative. Minimize f = 7x + 9y subject to the following constraints. x2 5 y ≤ 19 -x + y 2 2 X = y = f= Need Help? Submit Answer xxx Read It
1. If constraint has a shadow price of $6, Right-Hand-Side (RHS) is 12, allowable increase is 2, allowable decrease is 4. How would objective function change if the RHS of this constrains changes from 12 to 9? Answer___________
Use the graphical 2-D method to maximize subject to If there are no solutions, enter None for z. Maximum value is z = where x1 = and x2 = x1 3x1 X1 z = 6x1 + 2x2 + X2 + 4x2 + 3x2 X1 ≥ 0 > 21 72 <44 X2 ≥ 0
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
Show that any 2 *2 matrix A that does not have aninverse will have det A= 0.
For the remaining questions, consider the following problem description: An oil company is considering exploring new well sites S₁, S2, ..., S10 with respective costs C1, C2, C10. And in particular they want to find the least-cost selection of 5 out of the 10 possible sites. The binary decision variables x₁,x2,..., X10 denote the decision to explore the corresponding site.
Find a solution using the Simplex method (BigM method) MIN Z= 5x1 + 3x2 subject to 3x1 +x2 = 3 4x1 + 3x2>= 6 x1 +2x2 = 0 A. Construct the initial Tableau for the above simplex problem using the Big M B. Identify; the Leaving, Entering Variable, and the Pivot Number
Determine the pivot element in the simplex tableau. (If there is more than one correct pivot element, choose the element with the smaller row number.) X1 X2 X3 S1 S2 3 4 2 1 15 1 20 -8 -3 10 1 row column N O O
Solve the following Linear Programming model using the graphical method (USING EXCEL){Write the steps of construction} Q1)MaximizeH = x + 3y Objective functionsubject tox + y ≤ 502x + y ≤ 60 x ≥ 0, y ≥ 0
Simplex Method Write in normal form and solve by the simplex method, assuming x, to be nonnegative. 1. The owner of a shop producing automobile trailers wishes to determine the best mix for his three products: flat-bed trailers, economy trailers, and luxury trailers. His shop is limited to working 24 days/month on metal- working and 60 days/month on woodworking for these products. The following table indicates production data for the trailers. Usage per unit of trailer Flat-bed Economy Luxury Available resources 1 2 1 24 Metal work days Wood work days Contribution (Rx100) 60 4 6 2 14 13

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