Problem 2-10 (Algorithmic) For the linear program Max 3 A + 3 B s.t. A + 3B ≤ 9 10A + 6B ≤ 30 A, B ≥ 0 select the correct graph that identifies the optimal solution. What is the value of the objective function at the optimal solution? (i) BA (ii) BA (iii) BA (iv) BA The value of the objective function at the optimal solution is .
According to the given question, the objective function is written as:
subject to the constraint
and
By graphical method we can solve the linear program as follows;
In order to determined the straight line graph we consider two constraint as :
divide by 9 both side we get
Similarly
The graph of this two equation is shown as follows:
As this two constraint is less than type , therefore the feasible zone of this constraint should be towards the origin and hence the feasible solution at point
, and by solving equation (i) and (ii) we get as
.(-)......(-)............(-)..............................
and hence
Therefore the optimum solution at point x,y,z and origin is determined as:
Therefor the optimum solution at point y where and and maximum value of the objective function is determined as:
Problem 2-10 (Algorithmic) For the linear program Max 3 A + 3 B s.t. A + 3B ≤ 9 10A + 6B ≤ 30 A, B ≥ 0 select the correct graph that identifies the optimal solution. What is the value of the objective...
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 Max 3xl +2x2 S.t 1x1 + 1x2 〈 10 3x1 1x2 〈 24 1xl t 2x2< 16 And xl, x2> 0. a) Use Excel Solver to find the optimal solution to this problem. State the optimal values of xl, x2, and Z. b) Assume that the objective function coefficient for xl changes from 3 to 5. Does the optimal solution change? c) Assume that the objective function coefficient for x1 remains 3, but the objective...
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....
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 + 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:
Problem 3-02 (Algorithmic) Consider the following linear program: Max 3A 2B 1A 1B s 12 1A 2B s 20 A, B 2 0 The value of the optimal solution is 31. Spose that the right-hand side of the constraint 1 is increased from 12 to 13. a. Use the graphical solution procedure to find the new optimal solution. 26 Optimal Solahion A6584 2B-325 28-39 20 12-14 16 11 1012 14 1618 nv) B Optimal Solution 23-26 26 30 2 34...
Question 3 : Branch and Bound max 36a1282+8as s.t. 21i + 20r2 6xs 23 a e 10, 1]3 Write the LP Relaxation of this problem. 1. 2. What type of problem is this? (this type of problem has a particular name) Solve this problem by branch-and-bound, using the branching rule for binary variables of branching o 3. the most fractional variable. On the next page, write down the branch-and-bound tree you obtained. a. Each node should include the solution letter,...
LP PROBLEM PLEASE EXPLAIN thanks Search 3:30 Str1+2 + 23 + 4 2 + 35 (A) Calculate the optimal solution. Write the basis change in the optimal solution . (B) Find Inverse matrix B-1 of the optimal basis matrix C.) Consider increasing the constant on the right side of one constraint by 1. At that time, the smallest value of the objective function decreases most when the constant of the constraint is increased? D.) Find the range of t such...
Problem 3-12 (Algorithmic) Quality Air Conditioning manufactures three home air conditioners: an economy model, a standard model, and a deluxe model. The profits per unit are $67, $93, and $129, respectively. The production requirements per unit are as follows: Number of Manufacturing Number of Cooling Coils Time (hours) Fans Economy Standard 12 Deluxe 14 For the coming production period, the company has 250 fan motors, 360 cooling coils, and 1800 hours of manufacturing time available. How many economy models (E),...
how to graph this? is this correct? The aim of the objective function for Par Inc., should be to Maximize the objective value Objective function Max Z = 5S + 8D Subject to: (1/2)S + 1D <= 300 (C1) 1S + (2/3)D <= 420 (C2) a) The optimum solution is S = 330 D =135 b) Optimal solution value 'z' = 2730 Par, Inc., produces a standard golf bag and a deluxe golf bag on a weekly basis. Each golf...