🏠 Home How to use e-mentor 🎁 Earn Gifts by Studying
📚 Study Hub
🤖 AI Study PlannerPAID 🔁 Recap Cards ⚔️ 1v1 Study Duels NEW 📋 Test Series 💎 Test Series PackagesTIERS 🎁 Invite FriendsFREE PLANNER 📖 Track Chapters
⚡ Focus & Tools
🎧 Virtual Focus Room LIVE ⏱ Pomodoro Timer 🏆 Leaderboard 🎁 Earn Gifts by Studying
🌐 Community & Info
✍️ Blog ❓ Frequently Asked Questions ℹ️ Read Me First
Login Join Free
📢 UPDATES
📅 25th All India Debate Competition 2026  |  🏆 Leaderboard resets weekly — Keep your streak alive!  |  💡 Join Discussion Board for exam doubt clearing  |  📅 25th All India Debate Competition 2026  |  🏆 Leaderboard resets weekly — Keep your streak alive!  |  💡 Join Discussion Board for exam doubt clearing  | 

Ch 7: TRANSPORTATION — Previous Year Exam Questions (PYQ)

Final 📚 Strategic Cost Management 📖 Ch.7 — TRANSPORTATION ⭐ V1: Previous Year Question (PYQ) ⚡ Free Mode (Answers Locked)
⏱ Duration: 54 Mins 🎯 Total Marks: 30 Passed at: 12 Marks Max Attempts: 10
⚖️ Statutory Applicability: AY 2026-27 & Current Institute Curriculum

Answer ALL questions. Working notes / statutory sections must form part of the answers.

Login to Enroll & Start Join Free

📑 Exam Questions

6 Questions • Total 30 Marks

1(a): Linear Programming formulation of Transportation Problem

5 Marks
(i) The given problem is a balanced minimization transportation problem. The objective of the company is to minimize the cost. Let us find the initial feasible solution using Vogel’s Approximation method (VAM). Diff. - - - - - The initial feasible solution obtained by VAM is given below: Since the number of allocations = 6 = (m + n – 1), the above initial basic feasible solution is non-degenerate and hence an optimum solution can be obtained. Test of Optimality: Let us introduce ( ) 2, 1, i Ui = and Vj ( ) 3, 2, 1, J = . We assume U1 = 0 and other Ui and Vj can be calculated by using the relation Cij = Ui + Vj for allocated cells. The opportunity costs for the unallocated cells can be calculated using the relation ( ) j i ij ij V U C Δ + − = . The calculations of S ' V , S ' U j i and S ' Δij are given below: On Calculating S ' Δij for non-allocated cells, we found that all the Δij  , hence the initial solution obtained above is optimal. (ii) Calculations of the total costs: Plants Outlet Units Cost Total Cost X → B X = 2,400 X → D X = 1,800 Y → B X = Y → C X = Z →A X = 1,200 Z →D X = 1,000 7,350 The minimum cost = 7,350 thousand rupees.
🔒 Official Model Solution
Model answers and self-evaluation solutions are available in the Premium Tier & Rankers Plan.
Unlock Answers (₹1,000)

1(b): Linear Programming formulation of Transportation Problem

5 Marks
The problem given is an unbalanced one. To make it balanced we need to insert a dummy customer, say Z, with (25 – 23) = 2 trucks as it’s requirement. Now, the given transportation problem may be tabulated as under: Site/customers W X Y Z Availability A B C D Requirements Now, using Vogel’s Approximation Method (VAM) we get the Initial Feasible Solution (IFS) as put in Table –II Table -II Site/ Customer W X Y Z Availability Penalty A - - B C - D Requirements Penalty --- --- --- ---- ---
🔒 Official Model Solution
Model answers and self-evaluation solutions are available in the Premium Tier & Rankers Plan.
Unlock Answers (₹1,000)

2(a): Linear Programming formulation of Transportation Problem

5 Marks
With reference to the statutory framework governing 'Linear Programming formulation of Transportation Problem' under Strategic Cost Management (CMA Final), critically examine the substantive legal provisions, scope, and applicability thresholds. Specifically elucidate: (i) the governing statutory sections/rules/standards; (ii) eligibility conditions, numerical limits, and compliance parameters; and (iii) consequences of non-compliance or procedural default.
🔒 Official Model Solution
Model answers and self-evaluation solutions are available in the Premium Tier & Rankers Plan.
Unlock Answers (₹1,000)

2(b): Procedure of solution of Transportation Problems

5 Marks
An entity / assessee is subject to statutory and regulatory obligations concerning 'Procedure of solution of Transportation Problems' under Strategic Cost Management (CMA Final). Examine the practical application and computational methodology involved. Specifically elucidate: (i) applicable statutory principles and thresholds; (ii) step-by-step procedural/computational mechanics; and (iii) mandatory documentation and prescribed statutory filings.
🔒 Official Model Solution
Model answers and self-evaluation solutions are available in the Premium Tier & Rankers Plan.
Unlock Answers (₹1,000)

3(a): Special cases of Transportation

5 Marks
Critically evaluate the compliance architecture, reporting mandates, and statutory time limits governing 'Special cases of Transportation' under Strategic Cost Management (CMA Final). Specifically discuss: (i) key statutory provisions and recent regulatory amendments; (ii) procedural roadmap and e-filing requirements; and (iii) remedial mechanisms available in the event of administrative or statutory disputes.
🔒 Official Model Solution
Model answers and self-evaluation solutions are available in the Premium Tier & Rankers Plan.
Unlock Answers (₹1,000)

3(b): Linear Programming formulation of Transportation Problem

5 Marks
As a qualified professional consultant, provide a comprehensive advisory analysis on 'Linear Programming formulation of Transportation Problem' under Strategic Cost Management (CMA Final). Your advisory opinion must address: (i) statutory prerequisites and criteria; (ii) risk management and internal audit considerations; and (iii) authoritative legal precedents or administrative guidelines governing the issue.
🔒 Official Model Solution
Model answers and self-evaluation solutions are available in the Premium Tier & Rankers Plan.
Unlock Answers (₹1,000)
Advertisement

Quick Pomodoro Timer

Select a focus duration to launch your session:

25m Standard 50m Deep Focus 15m Quick Sprint
🎧 Join Virtual Focus Room (with 40Hz Audio) →
🔔
Daily Study Reminders
Get notified 15m before your target study sessions.