WorksheetsLinear Optimization (Math3122), Exam Questions Prepared by Walle
Total questions: 15
Worksheet time: 11mins
Name
Class
Date
1.
1.In Degenerate solution value of objective function.
a)
increases infinitely
b)
basic variables are non zero
c)
decreases infinitely
d)
. One or more basic variables are zero
2.
2.Minimize Z =
a)
–maximize(Z)
b)
-maximize(-Z)
c)
maximize(-Z)
d)
none
3.
3.In graphical representation the bounded region is known as region.
a)
Solution
b)
basic solution
c)
feasible solution
d)
optimal
4.
5. Graphical optimal value for Z can be obtained from
a)
Corner points of feasible region
b)
corner points of the solution region
c)
Both A and C
d)
none of the above
5.
6. In LPP the condition to be satisfied is
a)
Constraints have to be linear
b)
Objective function have to be linear
c)
both A and B
d)
none of the above
6.
7.A feasible solution of LPP
a)
Must satisfy all the constraints simultaneously
b)
Need not satisfy all the constraints, only some of them
c)
Must be a corner point of the feasible region
d)
all of the above
7.
8.Maximization of objective function in LPP means
a)
Value occurs at allowable set decision
b)
highest value is chosen among allowable decision
c)
all of the above
d)
none
8.
9.The linear function of the variables which is to be maximize or minimize is called
a)
Constraints
b)
Decision variable
c)
Objective function
d)
None
9.
10.The first step in formulating a linear programming problem is
a)
Identify any upper or lower bound on the decision variables
b)
State the constraints as linear combinations of the decision variables
c)
Understand the problem
d)
Identify the decision variables
10.
11.In Graphical solution the feasible region is.
a)
where all the constraints are satisfied simultaneously.
b)
any one constraint is satisfied.
c)
only the first constraint is satisfying
d)
any one of the above conditions.
11.
13.The necessary and sufficient condition for the existence of a feasible solution to a transportation problem is a solution that satisfies all the conditions of.
a)
supply.
b)
Demand
c)
supply and demand
d)
either supply or demand
12.
14.According to algebra of simplex method, slack variables are assigned zero coefficients because
a)
no contribution in objective function
b)
high contribution in objective function
c)
divisor contribution in objective function
d)
base contribution in objective function
13.
15.In linear programming, related problems in linear programming are classified as
a)
dual variables
b)
single problems
c)
double problems
d)
dual problems
14.
16.Suppose Mizan Tepi university requires 10, 12, and 12units chemicals A, B, C respectively to decorate mathematics Lab class. A liquid product contains 5,2 and 1 units of A, B and C respectively per Jar. A dry product contains 1,2 and 4 units of A, B, C per carton. If the liquid product sells for Rs. 3 per jar and
the Dry product sells Rs.2 per carton, how many of each should be purchased, in order to minimize the cost and requirements?
a)
Mizan Tepi university should purchase 2 jars of liquid product and 2 cartons of dry product then total cost will be Rs. 10.
b)
Mizan Tepi university should purchase 2 jars of liquid product and 25 cartons of dry product then total cost will be Rs. 10.
c)
Mizan Tepi university should purchase 21 jars of liquid product and 12 cartons of dry product, then total cost will be Rs.
d)
Mizan Tepi university should purchase 3 jars of liquid product and 2 cartons of dry product, then total cost will be Rs. 30.
15.
17.The expected outcome when players follow their optimal strategy is called
a)
Optimal strategy
b)
Value of the game
c)
Fair Game
d)
Mixed strategy
100 %
