Use Graphical Method as discussed in class to solve two-variable linear programming (LP) problems.1) Solve the following LP problemMaximize Z(x1, X2) = 3x1 + 2x2Subject to2x1 + x2 < 12- x1+ x2 < 3X1 2 0, x2 > 01.1) Draw the graph corresponding to the given constraint inequalities and non-negative conditions based on theabove LP model.1.2) On your graph, clearly identify the region of feasible solutions (feasible region) of this LP model.1.3) On your graph, use a dashed line to demonstrate how the optimal solution of this problem is to be found.1.4) Identify from your graph or calculate the value of the optimal solution (xi, x2).1.5) Calculate the corresponding optimal objective function value Z(xj , x;).

Answered: Solve the following LP problem Maximize…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter2: Introduction To Spreadsheet Modeling

Section: Chapter Questions

Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...

See similar textbooks

Similar questions

Don't solve. Please give- Decision Variable Constraint Objective function
a.) Formulate a LP model of this problem
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
b) The Scott Tractor Company ships tractor parts from Omaha to St. Louis by railroad. However, a contract limits the number of railroad cars the company can secure on each branch/arc during a week. Given these limiting conditions, the company wants to know the maximum number of railroad cars containing tractor parts that can be shipped from Omaha to St. Louis during a week. Phoenix Des Moines 3 5 6. 6. 1. Dallas 2 Omaha St. Louis 7. 3 Denver 6. ActivateW O 31°C
Define the term constraint.
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___________
Assuming that the company is interested in maximizing the total profit contribution, answer the following: A, What is the linear programming model for this problem? Decision Variables: LP Model: B.Find the optimal solution using the graphical solution procedure. 1.Feasible Region:2. Identify the binding constraint/s:3. Identify the rebundant constraint/s:4.How many gloves of each model should Kelson manufacture?5.What is the total profit contribution Kelson can earn with the given production quantities? C.How many hours of production time will be scheduled in each department? D.What is the slack time in each department? E.Compute the range of optimality for the objective function coefficients
Discuss the five (5) steps of the Theory of Constraints and apply each to asimulation/assumption of a constraint impacting Jaguar.
Find the dual of the problem.
In problems involving maximization and minimization, what is the objective function? States intended outcome in equation form Incorporates constraint of maximum budget Lists set of potential restrictions on the solution Cites constraints to ensure objectivity
(5) 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: _______________________________________________________________(c) Which of the following points yields the best solution? Underline the best solution: (7,5), (9,2), (6,6).Justify your answer (using the data from the above LP…
Find the x- intercept and y- intercept of each constraints and graph.

SEE MORE QUESTIONS

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Operations Management

ISBN:

9781259667473

Author:

William J Stevenson

Publisher:

McGraw-Hill Education

Operations and Supply Chain Management (Mcgraw-hi…

Operations Management

ISBN:

9781259666100

Author:

F. Robert Jacobs, Richard B Chase

Publisher:

McGraw-Hill Education

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Operations Management

ISBN:

9781259667473

Author:

William J Stevenson

Publisher:

McGraw-Hill Education

Operations and Supply Chain Management (Mcgraw-hi…

Operations Management

ISBN:

9781259666100

Author:

F. Robert Jacobs, Richard B Chase

Publisher:

McGraw-Hill Education

Business in Action

Operations Management

ISBN:

9780135198100

Author:

BOVEE

Publisher:

PEARSON CO

Purchasing and Supply Chain Management

Operations Management

ISBN:

9781285869681

Author:

Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson

Publisher:

Cengage Learning

Production and Operations Analysis, Seventh Editi…

Operations Management

ISBN:

9781478623069

Author:

Steven Nahmias, Tava Lennon Olsen

Publisher:

Waveland Press, Inc.

SEE MORE TEXTBOOKS

Solve the following LP problem Maximize Z(x1,x2) = 3x1 + 2x2 Subject to 2x1 + x2 < 12 - x1+ x2 < 3 X1 2 0, x2 2 0