Question: Solve the following graphically: Max z = 3x1 + 4x2 s.t. x1 + 2x2 16 2x1 + 3x2 18 x1 2 x2 10 x1, x2

Solve the following graphically:

Max z = 3x1 + 4x2

s.t. x1 + 2x2 16

2x1 + 3x2 18

x1 2

x2 10

x1, x2 0

What are:

-Decision Variables

-Objective Function

-Constraints

-Graphical Solution

  1. Show the feasible region (shade it), provide the x and y coordinates

  2. Show the corner points of the feasible region

  3. Find the minimum or maximum z-value of each corner point.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!

Q:

Cummings Inc. had the following reconciliation at December 31, 2017: Fair value of plan assets.......................$5,000 PBO...............................................4,200 Funded...

Q:

Problems For Problem 2: (2 decision variables) i.- Mathematical Formulation - : 1.Show the Decision Variables 2.Show the Objective Function 3.Show the Constraints ii.- Solution of the LP Problem...

Q:

Solve the following graphically: Max z = 3x1 + 4x2 s.t. x1 + 2x2

Q:

Solve the following graphically: Max z = 3x1 + 4x2 subject to x1 + 2x2 16 2x1 + 3x2 18 x1 2 x2 10 x1, x2 0 What are the optimal values of x1, x2, and z? select one . x1 = 9, x2 = 0, z = 27 x1 = 93,...

Q:

(25 points) Graphically find optimal solution (if any) to the following LP: max z = 3x1 + 2x2 s.t. x1 + 2x2 6 12 2x1 + 3x2 = 12 2x1 + x2 > 8 x1, x2 > 0

Q:

max z = 2 x 1 + 3 x 2 s.t. x 1 + 2 x 2 6 2 x 1 + x 2 4 x 1 , x 2 0 The following Simplex tableau corresponds to a basic feasible solution to the LP problem above. Row z x 1 x 2 s 1 s 2...

Q:

Consider the following LP Min z = x1 + x2 s.t x1 - 2x2 4 2x1 + x2 -2 x1 - x2 -3 x1, x2 0 a. (25 pts) Graphically solve this LP. You need to draw all the constraints, shade the feasible region, draw...

Q:

2 Use the simplex algorithm to solve the following LP: max z = 2xy + 3x2 s.t. x + 2x2 5 6 2x1 + x2 = 8 X1, X220 3 Use the simplex algorithm to solve the following problem: max z = 2x1 - x2 + x3 3x1 +...

Q:

Use branch-and-bound to solve the following IPs: max z = s.t. 2x + 3x x1 + 2x2 10 3x1 + 4x2 25 x1, x20; x1, x2 integer

Q:

Nazmi has a company producing two types of cars requiring the use of two machines. A type 1 car requires 1 hours on machine 1 and 2 hours on machine 2, whereas a type 2 car need 2 hours on machine 1...

Q:

In the rest of this chapter, we lead the reader through the formulation of several more complicated linear programming models. The most important step in formulating an LP model is the proper choice...

Q:

McClain Company incurred the following expenditures during 2016: Apr. 9 The air conditioning system in the old manufacturing codify was replaced for $83,000. The old air conditioning system had a...

Q:

A long cylindrical tube containing water is closed by an equiconvex lens of focal length 10 cm in air. A point source is placed along the axis of the tube outside it at a distance of 21 cm from the...

Q:

Actions that can lead to higher labor prodartivity in prodtaing fooffenar do NOr include increased use of mypriop materiak reduring the namber of models seodar od al a plant. Increasing worler bae...

Q:

atch the compensation objectives with their meanings. Efficiency Efficiency drop zone empty. Fairness Fairness drop zone empty. Compliance Compliance drop zone empty. Improving performance and...