Skip to content
Question 31 of 42
Q.
  1. The marginal cost C′(x)C'(x) and marginal revenue R′(x)R'(x) are given by C′(x)=50+x50C'(x)=50+\frac{x}{50} and R′(x)=60R'(x)=60. The fixed cost is ₹ 200. Determine the maximum profit. OR
  2. Using Vogel's approximation method, obtain the initial feasible solution of the following transportation problem.
D1D_1D2D_2D3D_3D4D_4Supply
O1O_1231176
O2O_210611
O3O_35815910
Demand7532
Tamil Nadu DgeTamil Nadu HSC (DGE) Commerce Board 2024Subjective· 5mImportance★★★★★
74% · 31/42 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

(a) Set MR=MC⇒x=500MR=MC\Rightarrow x=500; profit P(x)=10x−x2100−200P(x)=10x-\tfrac{x^2}{100}-200 gives ₹2300. (b) VAM initial solution costs ₹102.

Part (a) — maximum profit from marginals. Profit is greatest when marginal revenue equals marginal cost.

R′(x)=C′(x):60=50+x50 ⇒ x50=10 ⇒ x=500.R'(x)=C'(x):\quad 60=50+\frac{x}{50}\ \Rightarrow\ \frac{x}{50}=10\ \Rightarrow\ x=500.

Total revenue R(x)=∫R′(x) dx=∫60 dx=60xR(x)=\displaystyle\int R'(x)\,dx=\int 60\,dx=60x (with R(0)=0R(0)=0).

Total cost C(x)=∫C′(x) dx=∫ ⁣(50+x50)dx=50x+x2100+kC(x)=\displaystyle\int C'(x)\,dx=\int\!\left(50+\frac{x}{50}\right)dx=50x+\frac{x^{2}}{100}+k; fixed cost k=200k=200, so C(x)=50x+x2100+200C(x)=50x+\dfrac{x^{2}}{100}+200.

Profit:

P(x)=R(x)−C(x)=60x−(50x+x2100+200)=10x−x2100−200.P(x)=R(x)-C(x)=60x-\left(50x+\frac{x^{2}}{100}+200\right)=10x-\frac{x^{2}}{100}-200.

At x=500x=500:

P(500)=10(500)−5002100−200=5000−2500−200=2300.P(500)=10(500)-\frac{500^{2}}{100}-200=5000-2500-200=2300.

Part (b) — Vogel's Approximation Method. Balanced problem (supply =6+1+10=17==6+1+10=17= demand 7+5+3+27+5+3+2).

Working through the penalties (difference of the two smallest costs in each row/column) and allocating to the least-cost cell of the row/column with the largest penalty:

  1. Largest penalty column D4D_4 (=6) →\to least cost O2O_2 (=1): allocate 11 to (O2,D4)(O_2,D_4); O2O_2 exhausted.
  2. Largest penalty D2D_2 (=5) →\to least cost O1O_1 (=3): allocate 55 to (O1,D2)(O_1,D_2); D2D_2 met.
  3. Largest penalty O1O_1 (=5) →\to least cost D1D_1 (=2): allocate 11 to (O1,D1)(O_1,D_1); O1O_1 exhausted. …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.