Skip to content

Week 8 | Session 3: Demand Allocation Model & Capacitated Plant Location Problem

Course: Supply Chain Digitization — Module 3: Analytics in SCM



Demand Allocation Overview

SessionTopicMethod / Tool
W8 S1Facility SelectionBreak-Even Analysis
W8 S2Facility LocationCentre of Gravity + Excel Solver (GRG Nonlinear)
W8 S3Demand Allocation + CPLPLP formulation + Excel Solver (Simplex LP / Binary)

2. Case Study — Two Telecom Equipment Manufacturers

Section titled “2. Case Study — Two Telecom Equipment Manufacturers”

The Companies: Maxxio (North+East India) and Wavie Communications (South+West India). Both companies have enough capacity to fulfill all market demand. The decision is HOW to allocate, not whether.

Case Study Data


Question: How much quantity should be shipped from which plant to which market to minimize total cost?

  • Cij = unit cost of production + transportation from plant i to market j
  • Xij = quantity to be shipped from plant i to market j (decision variable)
  • Si = supply capacity of plant i
  • Dj = demand at market j
  • Minimize Z: Σi Σj (Cij × Xij) (total production + transportation cost)
  • Supply constraint: Σj Xij ≤ Si for all i (supply ≤ capacity)
  • Demand constraint: Σi Xij = Dj for all j (demand fully met)
  • Non-negativity: Xij ≥ 0 for all i, j

Solver Solution

The Kolkata facility is barely utilized despite fixed cost being incurred because of high production + shipping costs. But the fixed cost is still paid → inefficiency. This signals a need for a smarter model that also decides which plants to open.


4. Merger Scenario — Maxvie (Maxxio + Wavie)

Section titled “4. Merger Scenario — Maxvie (Maxxio + Wavie)”

Management merges the companies into a new company: Maxvie.

  • Now has 5 plants and needs to serve 6 markets.
  • New question: Which plants to keep open? Can any be shut to reduce cost?

This is a Capacitated Plant Location Problem (CPLP).


5. Capacitated Plant Location Problem (CPLP)

Section titled “5. Capacitated Plant Location Problem (CPLP)”
  • Add a binary decision variable yi for each plant i:
    • yi = 1 → plant i is open
    • yi = 0 → plant i is closed
  • Add fixed cost fi for each plant to the objective function.
  • Minimize Z: Σi Σj (Cij × Xij) + Σi (fi × yi) (variable cost + fixed cost of open plants)
  • Supply constraint: Σj Xij ≤ Si × yi for all i (plant can only supply if open)
  • Demand constraint: Σi Xij = Dj for all j
  • Binary variable: yi ∈ {0, 1} for all i
  • Solving Method: Simplex LP (model is linear — yi is handled via integer constraint).

CPLP Results


CPLP Solution (Maxvie — Merged):

  • Optimal plants to keep open: Chennai, Gurugram, Kolkata (only 3 out of 5).
  • Plants closed: Delhi and Mumbai (saving their fixed costs).
Cost ComponentMaxxioWavieCombined (Pre-merger)Maxvie Merged (CPLP)
Total Monthly Cost3.20 Cr2.53 Cr~5.73 Cr5.22 Cr

Monthly saving from merger + network redesign: approximately ₹50 lakhs / month.


  • Demand Allocation Model: Decides Xij to minimize variable cost — plants are fixed. (Simplex LP)
  • CPLP: Decides BOTH Xij (flow) AND yi (open/close plant) — minimizes variable + fixed cost. (Simplex LP with binary constraint)
  • Merger result: MaxV operates 3 plants instead of 5 → ~₹50L/month saving.