Consider the following linear program: Max. 2A + 10B s.t. 3A ≤ 15 B ≤ 6...

Question

Question

Consider the following linear program:

Max. 2A + 10B

s.t.

3A ≤ 15

B ≤ 6

4A + 4B = 28

A, B ≥ 0

a.) Plot a graph that shows the feasible region for the problem

b.) What are the extreme points of the feasible region

math Statistics-And-Probability

Answer 1

Answer #1

Max 24 +108 subject to . 3A < 15 BE6 4A + 4B = 28 A,B), Max 24x10B .60 Corner points (0,6) (1,6) (5,2) (5,0)

Answer 2

Similar Homework Help Questions

Consider the following linear program: Max 2A + 10B s.t. 3A ≤ 15 B ≤ 6...

Consider the following linear program: Max 2A + 10B s.t. 3A ≤ 15 B ≤ 6 4A + 4B = 28 A, B ≥ 0 a. draw graph that shows the feasible region for the problem b. What are the extreme points of the feasible region c. Draw graph that shows the optimal solution for the problem
For the linear program Max 3A+2B s.t. A+B>=4 3A+4B<=24 A>=2 A-B<=0 A, B>=0 a. Write the...

For the linear program Max 3A+2B s.t. A+B>=4 3A+4B<=24 A>=2 A-B<=0 A, B>=0 a. Write the problem in standard form. b. Solve the problem. c. What are the values of the slack and surplus variables at the optimal solution?
Consider the following linear program: Min 3A + 5B s.t. A + 2B ≥ 6 A...

Consider the following linear program: Min 3A + 5B s.t. A + 2B ≥ 6 A + B ≥ 4 A, B ≥ 0 What is the value of the objective function? If required, round your answer to one decimal place. Objective function value: Thanks is advance.

Consider the following linear program: Max Z = X1 – 2X2 Subject to – 4X1 +...

Consider the following linear program: Max Z = X1 – 2X2 Subject to – 4X1 + 3X2 <= 3 X1 – X2 <= 3 X1, X2 >= 0 a) Graph the feasible region for the problem. b) Is the feasible region unbounded? Explain. c) Find the optimal solution. d) Does an unbounded feasible region imply that the optimal solution to the linear program will be unbounded?
Consider the following linear program: Min 3A + 48 +28 26 AB 20 2. Select the...

Consider the following linear program: Min 3A + 48 +28 26 AB 20 2. Select the correct graph that shows the feasible region and the optimal solution for the problem. 0 (1) 10 8 Optimal Solution: A-2, B-2 - Optional Solution And, BM A (iv) Optimal Solution: A-0, B- Optimal Solution: A=2, B-2 b. What is the value of the objective function? If required, round your answer to one decimal place. Objective function value:
For the linear program Max 3 A + 3 B s.t. A + 2B ≤ 8...

For the linear program Max 3 A + 3 B s.t. A + 2B ≤ 8 5A + 3B ≤ 15 A, B ≥ 0 Draw graph that identifies the optimal solution. What is the value of the objective function at the optimal solution?

Consider the following linear program min -10.01 - 3.02 x1 + x2 + x3 = 4...

Consider the following linear program min -10.01 - 3.02 x1 + x2 + x3 = 4 5x 1 + 2x2 + x4 = 11 Z2 + 5 = 4 21,22,23,24,25 > 0 (a) Starting from the basis B = {2,3,4}, solve the linear program using the simplex method. (b) Removing the slack variables, we have the equivalent formulation. min -10:31 - 322 21 +224 5.11 + 2.22 <11 1 x2 < 4 21,220 Plot the feasible region and mark the...
business Problem 2-19 Consider the finear program Max 34 + 40 s.t. 1A+ 28s 8 1A28s 12 2A+ 18s 16 A, 82 0 or leave...

business Problem 2-19 Consider the finear program Max 34 + 40 s.t. 1A+ 28s 8 1A28s 12 2A+ 18s 16 A, 82 0 or leave the box blank the model, enter 0 for a. Write the problem in standard form, For those boxes n which you must enter sueractive or neostive nmbers use a meus sign, (Example:-300) f you dot need the vanable A. S e S St Max s.t. s A+ S A+ A, B, St, Sa, S b....
Consider the following all-integer linear program: Max x1+x2 s.t 4x1+6x2 <= 22 x1+5x2<= 15 2x1+x2<=9 x1,x2>=0...

Consider the following all-integer linear program: Max x1+x2 s.t 4x1+6x2 <= 22 x1+5x2<= 15 2x1+x2<=9 x1,x2>=0 integer Solve in Excel Solver and AMPL.

2. Consider the following linear model where C1 has not yet been defined. Max s.t. z...

2. Consider the following linear model where C1 has not yet been defined. Max s.t. z = C1x1 + x2 X1 + x2 = 6 X1 + 2.5x2 < 10 X1 > 0, x2 > 0 Use the graphical approach that we covered to find the optimal solution, x*=(x1, xỉ) for all values of -00 < ci so. Hint: First draw the feasible region and notice that there are only a few corner points that can be the optimal solution....