Numericals on Simplex Method of Linear Programming


0

(Simplex Method)

1.        Maximize Z = 10x1 + 5x2 subject to

4x1 + 5x2  \<100

5x1 + 2x2  \<80

x1 >/  0, x2  >/0

(Ans :  x1 = 200/17, x2 = 180/17 and maximum Z =2900/17 )

 

2.        Maximize Z = x1 + 4x2 + 5x3      (Constraints, 3 variables and all are  type)

Subject to    3x1 + 3x3 \< 22

x1 + 2x2 + 3x3  \<14

3x1 + 2x2  \<14

x1, x2, x3 >/ 0

                                                         (Ans :  x1 = 0, x2 = 7, x3 = 0  and maximum profit Z = 28)

 

3.        Maximize Z = 40x1 + 24x2      Total cost

Subject to    20x1 + 50x2  >/4800

80x1 + 50x2 + 3x3 >/ 14

x1, x2 >/ 0

(Ans :  x1 = 0, x2 = 144, S1 = 2400, S2 = 0    and Z = 24 x 144 = 3456 `)

 

4.        Solve the following Linear Programming problem by Simplex Method using the artificial variables.

Maximize Z = 3x1 + 5x2 

Subject to    x1 + x3 = 4

x2 + x4 = 0

3x1 + 2x2 + x5 = 12

x1, x2, x3, x4, x5 >/ 0

(Ans :  There is degeneracy in the solution because one of the variable in the basis is   x4 = 0, which is zero.)


Like it? Share with your friends!

0
MT UVA BMS

MT UVA- University, Vocational and Affiliated Education for BMS

53 Comments

  1. Drilling a wooden doorIf you are not using the same holes as the previously exiting set
    up. These blinds will not get bent and out of the living room, with all the doors using leftover house paint.
    You can paint the door of your house. To renovate your entire
    kitchen theme by choosing plain wooden doors.

Facebook comments: