Q1. Find the optimal solution of the following linear programing (LP) problem without using the Simplex Algorithm (Hint: Construct the dual model, find its optimal solution without using Simplex Algorithm and utilize the Complementary Slackness Theorem). (LP): max z- 4x1+3x2+6x3 Subject to 4x1 + x2 + 3x3 30 2x1 + 2x2 + 3x3 40 x1, x2, x320

Q1. Find the optimal solution of the following linear programing (LP) problem without using the Simplex Algorithm (Hint: Construct the dual model, find its optimal solution without using Simplex Algorithm and utilize the Complementary Slackness Theorem). (1.P):maxz=41+32+63Subjectto41+x2+33302x1+2x2+3x340x1,x2,x30 Q1. Find the optimal solution of the following linear programing (LP) problem without using the Simplex Algorithm (Hint: Construct the dual model, find its optimal solution without using Simplex Algorithm and utilize the Complementary Slackness Theorem). (LP):maxz=41+32+63Subjectto4x1+x2+333021+22+3340x1,x2,x30