Business Mathematics
Business Mathematics
Business Mathematics
ab a b
7544/NL a ac c
X–1/ 2110 b c bc
F3 26 24 16 90
6.
Differentiate w.r.t. x, log x a 2 x 2 .
Demand 180 120 150 450 7. Define Basic feasible solution and optimal
solution.
8. Define Lowest Cost Entry Method (LCEM) and 8. Differentiate w.r.t. x, xlog x.
Vogel's Approximation Method (VAM).
9. Define pay off matrix in Game Theory.
SECTIO N —C 10. If f and g are real functions defined by
3. inrnwiek dw mu`l pqw kro 7. iek kMpnI kol F1, F2, F3 'qy PYktrIAW hn ijhVIAW
ab a b W1, W2, W3 'qy mwl gudwm splweI krdI hY[ hPqwvwr
a ac c PYktrI smr`QwvW kRmvwr 200, 160, 90 XUint hn[
b c bc hPqwvwr mwl godwmW dIAW loVW kRmvwr 180, 120,
W1 W2 W3 pUrqI hY [
F1 16 20 12 200 2 5
5. 3 1 dw aultw pqw kro[
F2 14 8 18 160
F3 26 24 16 90 6.
w.r.t. x, log x a 2 x 2 AMqr spSt kro[
mM g 180 120 150 450
7. mu F lw sM B v ( Feasible) h` l Aqy Anu k U l qm
8. G`t qoN G`t lwgq AYNtrI ivDI (LCEM) Aqy vogl (Optimal) h`l dI pirBwSw idE[
dI Anumwn (Approximation) ivDI (VAM) dI pirBwSw
8. w.r.t. x, xlog x AMqr spSt kro[
idE[
2. aulty (Inverse) PMkSn dI pirBwSw idE[ qW pqw kro (f o g)(2) Aqy (g o f)(3).
(I + A) (I – A) = 0.