GATE Mechanical: Industrial Engineering and Operations Research, previous-year questions solved

Every industrial engineering question from the last four GATE Mechanical papers that has an official key: EOQ, reorder point, quantity discounts and MRP, linear programming (shadow prices, the dual, a simplex pivot), the assignment and transportation problems, CPM and PERT, exponential smoothing and forecast errors, an M/M/1 queue and critical-ratio scheduling. Each one has a step-by-step solution that matches the official answer key, the trap that catches most people, and a note on where the method is used in plants, warehouses and project offices.

Questions from official GATE ME papers (IIT Kharagpur 2022, IISc Bengaluru 2024, IIT Roorkee 2025, IIT Guwahati 2026); solutions by Skill-Lync. · Updated 16 Nov 2026 · 20 questions

GATE 2022 · ME Set-1 · Q.22MCQ · 1 markInventory control and MRP

Which one is NOT a form of inventory: raw materials, work-in-process, finished goods or CNC milling machines?

Which one of the following is NOT a form of inventory?
  1. (A)Raw materials
  2. (B)Work-in-process materials
  3. (C)Finished goods
  4. (D)CNC Milling Machines

Answer: (D) Official key: D

  1. Inventory is stock held to be used up or sold: raw materials waiting for production, work-in-process (partly made parts between operations) and finished goods waiting to be shipped. Spares and consumables (MRO stock) also count.
  2. A CNC milling machine is not consumed or sold; it is used again and again to make the product. It is a fixed asset (capital equipment), not inventory: option (D).
Where this shows up in industry

The split matters in the books and on the shop floor: inventory sits in working capital and is counted in stock-takes and ERP stock reports, while machines are fixed assets that are depreciated. Lean programmes attack work-in-process first, because parts waiting between machines hide quality problems and tie up cash.

GATE 2022 · ME Set-2 · Q.33NAT · 1 markInventory control and MRP

Demand 1000 parts a year, lead time 5 days, orders by EOQ: at what stock level should you reorder?

The demand of a certain part is 1000 parts/year and its cost is ₹1000/part. The orders are placed based on the economic order quantity (EOQ). The cost of ordering is ₹100/order and the lead time for receiving the orders is 5 days. If the holding cost is ₹20/part/year, the inventory level for placing the orders is _________ parts (round off to the nearest integer).

Answer: 14 parts Official key: 13 to 15

  1. The reorder point is the stock that covers demand during the lead time: .
  2. Daily demand: parts per day, so , which rounds to parts.

The EOQ ( parts) tells you how much to order, not when; the unit price and ordering cost are distractors here. A 360-day year gives 13.9, also inside the key; using 250 working days gives 20, outside it.

Where this shows up in industry

ERP systems (SAP's reorder point planning, for example) trigger a purchase requisition exactly this way when stock falls to the reorder level. In practice a safety stock is added on top, sized from how much demand and supplier lead time vary, so the line does not stop when a delivery is late.

GATE 2024 · ME · Q.38MCQ · 2 marksInventory control and MRP

Ordering 25% more than the EOQ: by what percentage does the total inventory cost rise?

A company orders gears in conditions identical to those considered in the economic order quantity (EOQ) model in inventory control. The annual demand is 8000 gears, the cost per order is 300 rupees, and the holding cost is 12 rupees per month per gear. The company uses an order size that is 25% more than the optimal order quantity determined by the EOQ model. The percentage change in the total cost of ordering and holding inventory from that associated with the optimal order quantity is
  1. (A)2.5
  2. (B)5
  3. (C)0
  4. (D)12.5

Answer: (A) Official key: A

  1. Total cost . At the EOQ the two terms are equal, and .
  2. For :
  3. With : , a rise of 2.5%: option (A).

The demand, ordering cost and holding cost drop out completely. With per gear per year you get and rupees a year, but the ratio is 1.025 whatever they are; even using the monthly figure by mistake gives the same 2.5%. The flat cost curve near the EOQ is why ordering in round lots barely costs anything.

Where this shows up in industry

Because the cost curve is so flat near the optimum, buyers round the EOQ to pallet, coil or box quantities without worrying: being 25% off costs only 2.5% more. What does hurt is a large error, for example ordering half or double the EOQ (25% more cost).

GATE 2025 · ME · Q.64NAT · 2 marksInventory control and MRP

3000 units a year with price breaks at 500 and 1000 units: what is the minimum total annual cost?

A company uses 3000 units of a part annually. The units are priced as given in the table below. It costs ₹ 150 to place an order. Carrying costs are 40 percent of the purchase price per unit on an annual basis. The minimum total annual cost is ₹ _______ (rounded off to 1 decimal place).
Order quantityUnit price (₹)
1 to 4999.0
500 to 9998.5
1000 or more8.0

Answer: ₹26050.0 Official key: 26000.0 to 26100.0

  1. Holding cost depends on price (), so find the EOQ at each price: with , .
  2. ₹8.0: , below 1000, so not allowed at this price; the cheapest quantity that gets ₹8.0 is 1000.
  3. ₹8.5: , inside 500 to 999: feasible. ₹9.0: , just above the 499 limit, so it cannot beat ₹8.5.
  4. :
    at :
    at : ₹26050.0.

Stopping at the feasible EOQ (₹27249.3) is the trap: with an all-units discount the cost must also be checked at every higher price break.

Where this shows up in industry

Purchase teams run exactly this comparison when a supplier quotes price breaks, then add what the textbook leaves out: storage space, shelf life, cash tied up and the risk of an engineering change making the stock obsolete. A bigger lot that looks cheaper on paper is often rejected for those reasons.

GATE 2026 · ME · Q.61NAT · 2 marksInventory control and MRP

Holding cost ₹0.50 per unit per month, ordering cost ₹550, demand 10000 a year: what is the EOQ?

The inventory holding cost of an item is ₹ 0.50 per unit per month and the ordering cost per order is ₹ 550. A stockist needs to supply 10000 units of the item per year to the customers. Assume demand is fixed and shortage cost is infinite. Using classical economic order quantity (EOQ) model, the optimal lot size is ________ units per order (rounded off to nearest integer).

Answer: 1354 units Official key: 1353 to 1355

  1. Put the holding cost on the same time basis as the demand: rupees per unit per year.
  2. units per order.

Using ₹0.50 directly with the annual demand gives 4690 units: the classic unit slip. Monthly demand (833.3) with the monthly holding cost gives the same 1354, because only the ratio matters.

Where this shows up in industry

Distributors and stockists recompute lot sizes when interest rates or warehouse rents change, because holding cost is mostly the cost of money tied up in stock plus storage. A common rule of thumb puts annual holding cost at roughly 20-30% of the item's value.

GATE 2022 · ME Set-1 · Q.59NAT · 2 marksInventory control and MRP

Component A appears at two levels of the product tree and 50 are in stock: how many more are needed for 10 units of P?

The product structure diagram shows the number of different components required at each level to produce one unit of the final product P. If there are 50 units of on-hand inventory of component A, the number of additional units of component A needed to produce 10 units of product P is _________ (in integer).
Product structure tree: one P needs 4 A and 2 B at level 1; each B needs 1 C and 3 D at level 2; each D needs 2 A at level 3P (1)A (4)B (2)C (1)D (3)A (2)Level 0Level 1Level 2Level 3

Answer: 110 units Official key: 110 to 110

  1. A is used in two places, so add both paths through the tree.
  2. Directly under P: .
  3. Under D: .
  4. Gross requirement ; net requirement units.

The common slip is adding the numbers in the boxes without multiplying down the tree, which gives ; quantities in a product structure are per unit of the parent, so they multiply along each branch.

Where this shows up in industry

This is a bill-of-materials explosion, the core of material requirements planning (MRP). ERP systems run it every night for thousands of part numbers: they explode the production plan through multi-level BOMs, net off stock and open orders, and offset each requirement by its lead time to create purchase and work orders.

GATE 2022 · ME Set-1 · Q.21MCQ · 1 markLinear programming, assignment and transportation

In linear programming, what is the shadow price of a resource that is not fully used?

In a linear programming problem, if a resource is not fully utilized, the shadow price of that resource is
  1. (A)positive
  2. (B)negative
  3. (C)zero
  4. (D)infinity

Answer: (C) Official key: C

  1. The shadow price of a resource is how much the optimal objective improves if one more unit of that resource is available.
  2. If some of the resource is already left over (its slack is positive), one more unit changes nothing, so its shadow price is zero: option (C).

This is complementary slackness: for every constraint, . A resource can have a non-zero shadow price only if it is used up completely.

Where this shows up in industry

Planners read shadow prices straight off the solver report (Excel Solver's sensitivity report, or the dual values in any LP solver) to decide where extra capacity pays: overtime on the bottleneck machine has a positive shadow price, more hours on a machine that already sits idle are worth nothing.

GATE 2026 · ME · Q.46MCQ · 2 marksLinear programming, assignment and transportation

Write the dual of a two-variable minimisation LP with four ≥ constraints

An objective function of primal variables ( and ) is described below: is the objective function of the dual of .
, , , and represent the corresponding dual variables.
Which one of the following options represents the correct form of ?
  1. (A)Maximize subject to , ,
  2. (B)Maximize subject to , ,
  3. (C)Maximize subject to , ,
  4. (D)Maximize subject to , ,

Answer: (A) Official key: A

  1. A minimisation with constraints and has a maximisation dual with constraints and . The right-hand sides (0.4, 0.6, 2.0, 1.8) become the dual objective coefficients: all four options agree on that.
  2. Each primal variable gives one dual constraint, built from its column of coefficients. Column of : 0.1, 0, 0.1, 0.2 with cost 0.07, so .
  3. Column of : 0, 0.1, 0.2, 0.1 with cost 0.05, so .
  4. That is option (A). (D) swaps the costs 0.07 and 0.05; (B) and (C) put in the constraint, i.e. they read the rows instead of the columns.
Where this shows up in industry

Dual values are the prices of the constraints, so a cost-minimising blend or diet problem like this one (minimum nutrient or property levels at least cost) tells the planner what each specification really costs. Feed mills, refineries and alloy melt shops use these numbers to argue about which spec limits are worth keeping.

GATE 2024 · ME · Q.39MCQ · 2 marksLinear programming, assignment and transportation

One simplex pivot from a given dictionary: what is the objective at the next basic feasible solution?

At the current basic feasible solution (bfs) (), the simplex method yields the following form of a linear programming problem in standard form.Here the objective function is written as a function of the non-basic variables. If the simplex method moves to the adjacent bfs () that best improves the objective function, which of the following represents the objective function at , assuming that the objective function is written in the same manner as above?
  1. (A)
  2. (B)
  3. (C)
  4. (D)

Answer: (A) Official key: A

  1. At the non-basic variables are zero and . Both and have negative coefficients, so raising either one lowers .
  2. Raise (with ): limits it to 2, to 3.5, does not limit it. So , leaves, and .
  3. Raise instead: only limits it, , . Entering improves more (−4 against −3), and it also has the steepest coefficient, so both rules pick .
  4. Rewrite with non-basic: , so : option (A).

(B) is the dictionary after the weaker pivot (enter , leaves). (C) uses the wrong leaving variable, and (D) has the wrong constant. The term says the method is not finished: enters next.

Where this shows up in industry

Commercial LP solvers (Gurobi, CPLEX, HiGHS) still run simplex variants for most production planning, blending and scheduling models; the pivot logic is the same, just with sparse matrix tricks for models with millions of variables. Knowing what one pivot does is what lets you read a solver log or a degenerate, stalling model.

GATE 2024 · ME · Q.65NAT · 2 marksLinear programming, assignment and transportation

Four suppliers and four retailers, all 300 units: what is the minimum transportation cost?

In a supplier-retailer supply chain, the demand of each retailer, the capacity of each supplier, and the unit cost in rupees of material supply from each supplier to each retailer are tabulated below. The supply chain manager wishes to minimize the total cost of transportation across the supply chain.
Supplier ↓ Retailer →IIIIIIIVCapacity
A11161913300
B51078300
C12141711300
D815119300
Demand300300300300
The optimal cost of satisfying the total demand from all retailers is _____ rupees (answer in integer).

Answer: ₹12300 Official key: 12300 to 12300

  1. Supply (1200) equals demand (1200), so the problem is balanced.
  2. Every supplier and every retailer has exactly 300 units, so an optimal plan sends each supplier's whole 300 to one retailer: the problem is an assignment problem with every cost multiplied by 300. (The corner points of this transportation problem are exactly the one-to-one plans.)
  3. Check all 24 one-to-one plans, or use the Hungarian method: the cheapest is unique, A → I (11), B → III (7), C → II (14), D → IV (9), total per unit; the next best costs 42.
  4. Minimum cost ₹12300.

The north-west corner start (A-I, B-II, C-III, D-IV) costs ₹14100: a feasible plan, not the optimum. The optimum can be confirmed with MODI (u-v) prices: no unused route has a negative reduced cost.

Where this shows up in industry

Distribution planners solve far larger versions of this (plants to warehouses to dealers, with capacities, lead times and truck sizes) in supply chain planning software. The classic transportation model is still the core, which is why GATE keeps asking it.

GATE 2022 · ME Set-1 · Q.58NAT · 2 marksLinear programming, assignment and transportation

An assignment problem's optimum is 500 min; Job 4 now takes 20 min longer on every machine: what is the new optimum?

An assignment problem is solved to minimize the total processing time of four jobs (1, 2, 3 and 4) on four different machines such that each job is processed exactly by one machine and each machine processes exactly one job. The minimum total processing time is found to be 500 minutes. Due to a change in design, the processing time of Job 4 on each machine has increased by 20 minutes. The revised minimum total processing time will be _____________ minutes (in integer).

Answer: 520 minutes Official key: 520 to 520

  1. Every feasible assignment uses exactly one cell of Job 4's row.
  2. Adding 20 to that whole row therefore adds exactly 20 to the total of every assignment, so the ranking of assignments does not change and the same assignment stays optimal.
  3. New minimum minutes.

Adding 20 for each of the four machines () is the trap: only one machine ends up doing Job 4. This row-constant property is also why the Hungarian method may subtract the row minimum from every row without changing the answer. (We also checked it numerically on 200 random 4 × 4 problems.)

Where this shows up in industry

Shop-floor dispatching, crew rostering and allocating parts to suppliers are all assignment problems. Planners rely on the same property when they adjust a whole row or column, for example a slower operator or an older machine, and know the optimal pairing does not move.

GATE 2022 · ME Set-1 · Q.42MCQ · 2 marksProject scheduling: CPM and PERT

Eleven activities A to K: what is the latest finish time of activity G?

Activities A to K are required to complete a project. The time estimates and the immediate predecessors of these activities are given in the table. If the project is to be completed in the minimum possible time, the latest finish time for the activity G is ____________ hours.
ActivityTime (hours)Immediate predecessors
A2─
B3─
C2─
D4A
E5B
F4B
G3C
H10D, E
I5F
J8G
K3H, I, J
  1. (A)5
  2. (B)10
  3. (C)8
  4. (D)9

Answer: (B) Official key: B

  1. Forward pass (earliest finish): A 2, B 3, C 2, D 6, E 8, F 7, G 5, H , I 12, J 13, K . The project takes 21 hours; the critical path is B-E-H-K.
  2. Backward pass: K must finish by 21, so it must start by 18. J's only successor is K, so J must finish by 18 and start by .
  3. G's only successor is J, so the latest finish of G is 10 hours: option (B).

5 is G's earliest finish (forward pass only). G has hours of float, so a delay of up to 5 hours on C, G or J together does not delay the project.

Where this shows up in industry

Every project schedule in MS Project or Primavera P6 is computed with these forward and backward passes. Total float is what planners watch: when it hits zero on a path, that path has become critical and any slip there moves the delivery date.

GATE 2022 · ME Set-2 · Q.59NAT · 2 marksProject scheduling: CPM and PERT

Five activities with optimistic, most likely and pessimistic times: what is the expected project time?

A project consists of five activities (A, B, C, D and E). The duration of each activity follows beta distribution. The three time estimates (in weeks) of each activity and immediate predecessor(s) are listed in the table. The expected time of the project completion is __________ weeks (in integer).
Time estimates (in weeks): optimistic time , most likely time , pessimistic time .
ActivityImmediate predecessor(s)
A456None
B135A
C123A
D246C
E345B, D

Answer: 15 weeks Official key: 15 to 15

  1. PERT expected time of each activity:
  2. , , , , . (Each estimate here is symmetric, so equals the most likely time.)
  3. Paths: A-B-E ; A-C-D-E .
  4. The expected completion time is the longest path: weeks (critical path A-C-D-E).
Where this shows up in industry

Three-point estimates are still how project managers price uncertainty in R&D, new-product launches and plant shutdowns. Modern tools go one step further and run Monte Carlo simulation on the network, because PERT's single critical path tends to understate the risk when several paths are nearly critical.

GATE 2025 · ME · Q.65NAT · 2 marksProject scheduling: CPM and PERT

Eight activities A to H: what is the slack of activity D?

A project involves eight activities with the precedence relationship and duration as shown in the table below. The slack for the activity D is _____ hours (answer in integer).
ActivityImmediate predecessorDuration (hours)
A-4
BA8
CA5
DB2
EB7
FC6
GD3
HE, F, G9

Answer: 2 hours Official key: 2 to 2

  1. Forward pass (earliest start, finish): A 0-4, B 4-12, C 4-9, D 12-14, E 12-19, F 9-15, G 14-17, H starts at and ends at 28.
  2. Backward pass: H must start by 19, so G must finish by 19 and start by 16; D's only successor is G, so D must finish by 16 and start by 14.
  3. Slack of D: hours.

The critical path is A-B-E-H (28 hours). The path through D (A-B-D-G-H, 26 hours) is 2 hours shorter, which is the same 2 hours of slack shared by D and G.

Where this shows up in industry

Slack tells a site or plant manager which jobs can be shifted to level out labour and crane demand without moving the finish date. Resource levelling in scheduling software uses exactly this float, starting with the activities that have the most of it.

GATE 2026 · ME · Q.65NAT · 2 marksProject scheduling: CPM and PERT

A PERT network of eight activities from node 1 to node 6: what is the expected project length?

The activities of a PERT network and their corresponding activity time estimates (in weeks) i.e., optimistic (), most likely (), and pessimistic () are given in the table below.
Activity
1−22412
1−3246
1−43411
2−5369
3−42514
3−5333
4−53615
5−6258
The expected project length is ________ weeks (in integer).

Answer: 22 weeks Official key: 22 to 22

  1. for each activity: , , , , , , , .
  2. All paths from node 1 to node 6, in weeks: : 22; : 17; : 16; : 12.
  3. The expected project length is the longest path: weeks, along 1-3-4-5-6.

Using the most likely times alone gives 20 weeks, which is the trap: activities 3-4 and 4-5 have long pessimistic tails (14 and 15 weeks), and PERT's weighted mean pulls them up.

Where this shows up in industry

Long pessimistic tails are typical of tasks that depend on outside parties, such as tooling from a vendor, certification tests or customs clearance. Planners flag activities with a wide spread between and for early follow-up, because they drive both the expected date and its uncertainty.

GATE 2022 · ME Set-2 · Q.32NAT · 1 markForecasting

January sales were 120 and the forecast was 20 too low: what is February's forecast with α = 0.2?

An electric car manufacturer underestimated the January sales of car by 20 units, while the actual sales was 120 units. If the manufacturer uses exponential smoothing method with a smoothing constant of , then the sales forecast for the month of February of the same year is ___________units (in integer).

Answer: 104 units Official key: 104 to 104

  1. Underestimated by 20 means the January forecast was .
  2. units.

Reading it as a forecast of 140 gives 136: an underestimate means the forecast was below the actual.

Where this shows up in industry

Exponential smoothing (and its trend and seasonal versions, Holt and Holt-Winters) is the default forecasting method in most demand planning software, because it needs only the last forecast and the latest actual. A small α like 0.2 gives a steady forecast that ignores one-off spikes.

GATE 2025 · ME · Q.37MCQ · 2 marksForecasting

Ten periods of demand and forecast: what are the mean forecast error and the mean absolute deviation?

Considering the actual demand and the forecast for a product given in the table below, the mean forecast error and the mean absolute deviation, respectively, are
PeriodActual demandForecast
1425427
2415422
3420416
4430422
5427423
6418420
7422419
8416418
9426430
10421415
  1. (A)0.8 and 42.0
  2. (B)0.8 and 4.2
  3. (C)8.0 and 42.0
  4. (D)8.0 and 4.2

Answer: (B) Official key: B

  1. Errors (actual − forecast), period 1 to 10: , , , , , , , , , .
  2. Mean forecast error .
  3. Mean absolute deviation .
  4. 0.8 and 4.2: option (B).

The options with 8.0 and 42.0 are the sums, not the means. A small mean error with a much larger MAD means the forecast is nearly unbiased but still misses by about 4 units a period in either direction.

Where this shows up in industry

Demand planners track both numbers every month: the mean error (bias) shows whether the forecast is systematically high or low, and MAD sizes the safety stock (for normally distributed errors the standard deviation is about 1.25 × MAD). A tracking signal, the running sum of errors divided by MAD, flags a forecast that has drifted.

GATE 2026 · ME · Q.60NAT · 2 marksForecasting

Actual demand 500 then 635, January forecast 250, α = 0.7: what is the March forecast?

The actual demand for castings in a factory is 500 units and 635 units for the months of January 2026 and February 2026, respectively. The forecasted demand for January 2026 is 250 units and smoothing constant is 0.7. Using the exponential smoothing method, the forecast of the demand for castings in March 2026 is________ units (in integer).

Answer: 572 units Official key: 572 to 572

  1. , applied twice.
  2. February: .
  3. March: units.

Skipping the February update and smoothing 635 against the January forecast gives 519.5. A high α (0.7) makes the forecast chase the latest actual: it closed most of a 250-unit gap in one month.

Where this shows up in industry

Foundries and forge shops plan melt schedules and raw material from forecasts like this. A high smoothing constant reacts quickly to a genuine jump in orders but also to noise, so planners usually keep α between 0.1 and 0.3 and switch to a trend model when demand is clearly growing.

GATE 2024 · ME · Q.35MCQ · 1 markProduction scheduling and queueing

Arrivals 5 jobs per hour, mean service 6 minutes, single server: what is the probability the server is idle?

A queueing system has one single server workstation that admits an infinitely long queue. The rate of arrival of jobs to the queueing system follows the Poisson distribution with a mean of 5 jobs/hour. The service time of the server is exponentially distributed with a mean of 6 minutes. In steady state operation of the queueing system, the probability that the server is not busy at any point in time is
  1. (A)0.20
  2. (B)0.17
  3. (C)0.50
  4. (D)0.83

Answer: (C) Official key: C

  1. This is an M/M/1 queue. Arrival rate jobs/hour; a mean service time of 6 minutes means a service rate jobs/hour.
  2. Utilisation : the server is busy half the time.
  3. Probability the server is idle: : option (C).

Reading the 6 minutes as 6 jobs/hour gives (option D) and (option B).

Where this shows up in industry

The same formulas size inspection stations, tool cribs, maintenance crews and AGV fleets. The key lesson is how fast waiting grows with utilisation: in an M/M/1 queue the average number in the system is , 1 job at 50% utilisation but 9 at 90%, which is why bottleneck machines are never planned at 100%.

GATE 2026 · ME · Q.47MCQ · 2 marksProduction scheduling and queueing

On day 20, which jobs have a critical ratio below 1?

Four jobs are on order in a factory. As on day 20 of the production calendar, the corresponding due date and work remaining to complete these jobs (in days) are given in the table below.
JobDue dateWork remaining (in days)
M265
N2410
O2810
P315
Which job(s) has/have critical ratio less than unity?
  1. (A)Job N and Job O
  2. (B)Job M and Job N
  3. (C)Job P
  4. (D)Job O and Job P

Answer: (A) Official key: A

  1. Critical ratio is the time left until the due date divided by the work remaining:
  2. M: ; N: ; O: ; P: .
  3. Below 1 (behind schedule): N and O, option (A).

A CR below 1 means the job cannot finish on time at the normal pace; the CR rule runs the lowest ratio first, so the order would be N, O, M, P.

Where this shows up in industry

Job shops and tool rooms use critical ratio in their dispatch lists because it updates itself every day: as the due date approaches, a job's ratio falls and it climbs the list. Manufacturing execution systems show it next to each work order so supervisors can see which jobs need overtime.

From GATE prep to a manufacturing and operations career

Talk to a counsellor.

Talk to a career counsellor

Free 20-minute call. We'll map the right course to where you want to work.

By submitting you agree to our Terms and Privacy Policy.

Talk to a career counsellor

Talk to a career counsellor

Free 20-minute call. We'll map the right course to where you want to work.

By submitting you agree to our Terms and Privacy Policy.