00:01
Hi, here in this question we are given that the lpp problem is maximum equals to 3a plus 2 times b.
00:11
Subject to constraint are a plus b greater than or equal to 4.
00:17
Similarly 3a plus 4b less than or equal to 24, a greater than or equal to 2a minus b less than or equal to 0.
00:30
And b are greater than or equal to 0 here our first equation is we need to write the given lpp problem in the standard form the standard form of lpp problem consists of both select and sub plus variable therefore here in our case we have maximum as objective function would be 3a plus 2 times b now here for subject to constraint now subject to constraint are a plus b plus c equals to 4.
01:11
Second equation is 3a plus 4 b plus 0 times c minus d equals to 24 similarly third equation is a plus 0 times c plus 0 times b plus 0 times b plus e equals to 2 similarly, the fourth equation would be a minus b plus 0 times c plus 0 time b plus 0 times e minus f equals to 0, where the values of a, b, c, b, c, b, e, f are all greater than or equal to 0.
01:56
The first answer required standard form of the lpp problem.
02:01
Now here for the given lpp problem the graph is, now here from this graph we can observe that the optimal solution is at a point 24 upon 7 comma 24 upon 7...