MTH601 Latest Unsolved MCQs for Final Term Attempt by M.Zeeshan

Quiz Start Time: 03:19 PM
Time Left 48
sec(s)

Question # 1 of 10 ( Start time: 03:19:21 PM ) Total Marks: 1

Solution region of the constraints: ‘2x+3y>12’ and ‘2x+3y<12’ will be the———.

Select correct option:

straight line:2x+3y=12

empty set
all first quadrant C

point(6,4)

Quiz Start Time: 03:19 PM
Time Left 10
sec(s)

Question # 2of 10 ( Start time: 03:20:29 PM) Total Marks: 1

In graphical solution of solving Linear Programming problem to convert inequalities into equations, we —————-.

Select correct option:

use Slack variables

use Surplus variables

simply assume them to be equations
use Artificial surplus variables C

Quiz Start Time: 03:19 PM
Time Left 17
sec(s)

Question # 3of 10 ( Start time: 03:23:17 PM) Total Marks: 1

The solution set of the constraint: 2x+3y<12, will lie in ——— bisected by the line:2x+3y=12.

Select correct option:

origin side of half plane opposite to the origin
side in half plane
both half planes
first quadrant only

Quiz Start Time: 03:19 PM Time Left 5 sec(s)

Question # 4of 10 ( Start time: 03:24:34 PM) Total Marks: 1

The Simplex method is a————– for solving Linear Programming problem.

Select correct option: graphical procedure
analytical procedure probabilistic
procedure computational
procedure(Algorithm)

Quiz Start Time: 03:19 PM Time Left 21 sec(s)

Question # 5 of 10 ( Start time: 03:26:02 PM ) Total Marks: 1

After converting constraints into the respective Standard equalities, we have an LP problem of ‘4’ equations in ‘6’ variables. If the initial basic feasible solution is say;(2,4,1,2), then its corresponding non-basic solution is———.

Select correct option:

(0,0) 
(-4,-2)
(1,2)
(2,2)

Quiz Start Time: 03:19 PM Time Left 4 sec(s)

Question # 6of 10 ( Start time: 03:27:16 PM) Total Marks: 1

For a LP problem say;Max:z=x+y,under the constraints x,y>=0, the feasible region would be——–.

Select correct option:

empty

all xy-plane 

all the first quadrant
point(0,0)

Quiz Start Time: 03:19 PM
Time Left 21
sec(s)

Question # 7of 10 ( Start time: 03:28:44 PM) Total Marks: 1

After converting constraints into the respective Standard equalities, we have an LP problem of ‘4’ equations in ‘6’ variables. If the initial basic feasible solution is say;(2,4,1,2), then it is ———- solution.

Select correct option:

degenerate feasible

non-degenerate feasible

degenerate infeasible

non-degenerate infeasible

Quiz Start Time: 03:19 PM
Time Left 9
sec(s)

Question # 8of 10 ( Start time: 03:29:58 PM) Total Marks: 1

While applying Simplex method to a LP of minimization type, we proceed stepwise from one basic feasible solution to another in such a way that the objective function always ———- its value.

Select correct option:

increases
decreases
does not change

oscillate

Quiz Start Time: 03:19 PM
Time Left 37
sec(s)

Question # 9 of 10 ( Start time: 03:31:23 PM ) Total Marks: 1

Which of the following is true about the inclusion of non-negative slack variable into a constraint of type ‘less than or equal’?

Select correct option:

This inclusion doest not affect the inequality

Inequality is transformed into type: ‘greater than or equal’
Inequality become redundant and hence skips from the LP problem.
Inequality is transformed into strict equality constraint

Quiz Start Time: 03:19 PM
Time Left 53
sec(s)

Question # 10of 10 ( Start time: 03:32:20 PM) Total Marks: 1

Convex set is the collection of all ————-.

Select correct option:

optimal solutions

feasible solutions
non-feasible solutions

negative solutions