MTH601 Final Term Subjective by Hussnain Ali

Mth601 · Practise Questions Lecture 23 · Solution of lecture 23 · Practice Questions Lecture 24 · Solution of lecture 24 · Practice Questions Lecture 25 · Solution of lecture 25 · Practice Questions Lecture 26 · Solution of lecture 26 · Practice Questions Lecture 27_28 Solution of lecture 27-28 · Practice Questions Lecture 29_30 Solution of lecture 29-30 · Practice Questions Lecture 31 · Solution of lecture 31 · Practice Questions Lecture 31_34 Solution of lecture 31_34 · Practice Questions Lecture 35_37 Solution of lecture 35-37 · Practice Questions Lecture 40

Q1. standard

Maximize Z x x x

x x x x x x x and x x x Write the form and starting tableau of min the linear program g problem

Q2. Discuss the feasibility of the initial basic solution to a linear programming problem subject to the following constraint.

Z=4x +3x

x +x x +2x 3x +2x x ,x Maximize

Q3. Convert the following minimization problem into maximization problem Z=x -3x +2x

3x -x +2x -2x +4x -4x +3x +8x x ,x ,x Minimize

Q4. Initial basic feasible solution of linear programming problem is given in the following table

Eq.No · B.Variable · Z · x1 · x2 · x3 · S1 · S2 · S3 · RHS · Ratio

-3 -5 -4

S1 · S2 · S3

Q1. Discuss differences between maximization and minimization linear programming problems.

Q2. Discuss the degeneracy of the initial basic feasible solution of following linear programming problem.

Maximize Z x x x

x x x x x x x

Q3. Transform the following linear programming problem into maximization model .Also discuss the degeneracy of the initial feasible solution.

Minimize Z x x

x x x x x x