Question: Consider the following linear programming problem : Minimize : Z = C121 + 0242 + 0323 Subject to: X 1 22 + 2x3 > 3..........

Consider the following linear programming problem

Consider the following linear programming problem : Minimize : Z = C121 + 0242 + 0323 Subject to: X 1 22 + 2x3 > 3.......... (1) 2x1 2x2 + x3 > 2.......... (2) 2x1 + x2 5x3 > 8........-- (3) 21, 22, 23 > 0 If ci = 15, C2 = ci 20 and c3 = 31 , find the optimal solution. Classify the type of the solution

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!

QUESTION TWO (a) Solve the following Linear programming problem using the simplex method: Maximize Z = 10X, +15X2 + 20X, subject to: 2X1 + 4X2 +6X, 24 3X1 +9X, +6X, 0 (15 Marks) (6) Suppose X1, X3,...

Consider the following linear programming problem, and its optimal final tableau shown below: Maximize 2x1 + x2 x3 s.t. x1 + 2x2 + x3 8 x1 + x2 2x3 4 x1, x2, x3 0 Final tableau Z x1 x2 x3 x4 x5 RHS Z...

[6.54] Consider the following linear programming problem and its optimal final tableau shown below: Maximize 2x1 + x2 - X3 subject to x + 2x3 + x 38 - x1 + x2 - 2x3 = 4 x1, x2, x > 0. Final Tableau:...

Question No. 1115 Marks] (A) The manager of a cafeteria at a university wants to monitor the service quality of the checkout process. Students have complained that some cashiers take too long to add...

Consider the following linear programming problem: Minimize Z= 4X1 + 10 X2 +9X3 Subject to: X2 X3 12 - 2x1 + x2 + 3x3 4 X1, X2, X320 X1 + 1. Construct a dual problem. 2. Is there an optimal solution...

A grocery store must decide on the shelf space to be allocated to each of five types of breakfast cereals. The maximum daily demand is 100, 85, 140, 80, and 90 boxes, respectively. The shelf space in...

1.Consider the following optimization model: Maximize : Z = X 1 - X 2 + 3X 3 Constraints: X 3 1 + X 2 - X 3 357 3X 1 - 6X 2 - 8X 3 125 -5X 1 - 2X 2 - 7X 3 -1033 X 1 , X 2 , X 3 0 This optimization...

Solve the linear programming problems by drawing the feasible solution region and using the corner point table. 1.1 Maximize: P = 20x + 10y subject to: 3x + y 21 x + y 9 x + 3y 21 x, y 0 1 .2...

operation research course Consider a two-verlable linear programming problem whose CPF solutions are (0,0).(6.0), (6, 31.8., and (0, 2). The feasible region graph is given below (3.3) (0.2) (0,0)...

For each of the following circumstances, identify which revenue recognition criterion/ criteria is/are NOT met at the point of sale, preventing the recognition of revenue at that time. (Italics...

Another measure of variation is the mean absolute deviation. It is computed using the formula Compute the mean absolute deviation of the data in Problem 11 and compare the results with the sample...

Use a calculator to convert these fractions to decimals. a 7925 C b d 2899

As the manager of Smith Construction, you need to make a decision on the number of homes to build in a new residential area where you are the only builder. Unfortunately, you must build the homes...