Skip to content
Exercises · Q9

Q.Suppose a consumer wants to consume two goods which are available only in integer units. The two goods are equally priced at Rs 10 and the consumer's income is Rs 40.

(i) Write down all the bundles that are available to the consumer.
(ii) Among the bundles that are available to the consumer, identify those which cost her exactly Rs 40.
Uttar Pradesh UpmspTextbookSubjective· 3mImportance★★★★★
26% · 9/35 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 →

With income Rs 40 and both goods priced at Rs 10, the consumer can afford any bundle (x1,x2)(x_1, x_2) where 10x1+10x2≤4010x_1 + 10x_2 \leq 40, i.e., x1+x2≤4x_1 + x_2 \leq 4 in non-negative integers. Bundles costing exactly Rs 40 satisfy x1+x2=4x_1 + x_2 = 4.

Understanding the Budget Constraint

A consumer's budget set consists of all commodity bundles she can afford given her income and the prices she faces. When goods come in integer units only, we're looking at discrete points rather than a continuous budget line.

The budget constraint here is straightforward. If good 1 costs Rs 10 per unit and good 2 also costs Rs 10 per unit, then a bundle (x1,x2)(x_1, x_2) costs 10x1+10x210x_1 + 10x_2. The consumer can afford this bundle if and only if:

10x1+10x2≤4010x_1 + 10x_2 \leq 40

Simplifying by dividing through by 10:

x1+x2≤4x_1 + x_2 \leq 4

Since goods are available only in integer units, both x1x_1 and x2x_2 must be non-negative integers (you can't buy −1-1 apples or 2.52.5 oranges in this market).

(i) All Available Bundles

We need every pair of non-negative integers (x1,x2)(x_1, x_2) such that x1+x2≤4x_1 + x_2 \leq 4.

Start systematically:

  • When x1=0x_1 = 0: x2x_2 can be 0,1,2,3,40, 1, 2, 3, 4 → bundles (0,0),(0,1),(0,2),(0,3),(0,4)(0,0), (0,1), (0,2), (0,3), (0,4)
  • When x1=1x_1 = 1: x2x_2 can be 0,1,2,30, 1, 2, 3 → bundles (1,0),(1,1),(1,2),(1,3)(1,0), (1,1), (1,2), (1,3)
  • When x1=2x_1 = 2: x2x_2 can be 0,1,20, 1, 2 → bundles (2,0),(2,1),(2,2)(2,0), (2,1), (2,2)
  • When x1=3x_1 = 3: x2x_2 can be 0,10, 1 → bundles (3,0),(3,1)(3,0), (3,1)
  • When x1=4x_1 = 4: x2x_2 can be 00 → bundle (4,0)(4,0)

That gives us 15 bundles in total.

x1x_1Available values of x2x_2Bundles
00, 1, 2, 3, 4(0,0), (0,1), (0,2), (0,3), (0,4)
10, 1, 2, 3(1,0), (1,1), (1,2), (1,3)
20, 1, 2(2,0), (2,1), (2,2)
30, 1(3,0), (3,1)
40(4,0)

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.