ASSIGNMENT

BCOM 105- QUANTITATIVE TECHNIQUES FOR COMMERCE

UNIT III
MCQ
2
1. ∫0 𝑥 2 dx =

a) 2
b) 2/3
c) 8/3
d) None of these

1
2. The value of ∫0 𝑦 dy is 1.
a) True
b) False

3. Which of the following must be true when the marginal is negative?

a) The average is positive.
b) The average is negative.
c) The total is decreasing.
d) The total is negative.

4. If MR= 15- 2x- x2, the value of maximum revenue is

a) 45
b) 35
c) 55
d) None of the above

SUBJECTIVE QUESTIONS

Ques 1 Write a note on consumer’s surplus and producer’s surplus.

𝑒 𝑥 +𝑒 −𝑥
Ques 2 Evaluate ∫ 𝑒 𝑥−𝑒 −𝑥 𝑑𝑥
Ques 3 A company manufacturing T.V. sets determines that it’s production facility is following a
learning curve of the form f(x)=1400 x-0.3 after producing 100 T.V. sets, where f(x) denotes the rate of
labour hours. How many total labour hours are required to produce 200 additional units?

𝑥 3 −5𝑥
Ques 4 Find ∫ (𝑥2 −9)(𝑥2 +1) 𝑑𝑥

Ques 5 Find the area of the region bounded by the curve y= |x|, the x-axis and the two lines x=-2 and
x=1.
 ASSIGNMENT
BCOM 105- QUANTITATIVE TECHNIQUES FOR COMMERCE
UNIT IV
MCQ
1. Region represented by x ≥ 0, y ≥ 0 is:
a) first quadrant
b) second quadrant
c) third quadrant
d) fourth quadrant

2. The point which does not lie in the half-plane 2x + 3y -12 < 0 is:
a) (2,1)
b) (1,2)
c) (-2,3)
d) (2,3)

3. The co-ordinates of the corner points of the bounded feasible region are (3, 3), (20, 3), (20, 10),
(18, 12) and (12, 12). The minimum value of an objective function z = 2x + 3y occurs at corner
point

a) (18, 12)
b) (12, 12)
c) (20, 10)
d) (3, 3)

4. Which variable is introduced in simplex method to eliminate ≤ sign?

a) Basic variables
b) Non basic variables
c) Slack variables
d) Surplus variables

SUBJECTIVE QUESTIONS

Ques 1 Write the steps involved in solving an LPP by simplex method.

Ques 2 Define feasible solution, feasible region, optimal solution, unbounded feasible region,
infeasible solution and shadow prices.
Ques 3 Find the optimal solution using simplex method
𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑍 = 30𝑥1 + 40𝑥2 + 20𝑥3
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 𝑐𝑜𝑛𝑠𝑡𝑟𝑎𝑖𝑛𝑡𝑠:
 10𝑥1 + 12𝑥2 + 7𝑥3 ≤ 10,000
7𝑥1 + 10𝑥2 + 8𝑥3 ≤ 8000
𝑥1 + 𝑥2 + 𝑥3 ≤ 1000
𝑥1 , 𝑥2 , 𝑥3 ≥ 0

Ques 4 Explain briefly the economic interpretation of the dual.

Ques 5 Find the optimal solution graphically

𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑍 = 10𝑥1 + 6𝑥2
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 𝑐𝑜𝑛𝑠𝑡𝑟𝑎𝑖𝑛𝑡𝑠:
3𝑥1 + 2𝑥2 ≤ 12
2𝑥1 + 5𝑥2 ≤ 34
𝑥1 , 𝑥2 ≥ 0