Team Formation & Selection
Selecting committees/teams subject to inclusion-exclusion conditions.
Overview
Team Formation (Selection) problems ask you to choose a subset of people or objects from a larger group, subject to conditions. On CAT, these appear as DILR sets where you must determine valid team compositions. On GMAT, similar logic appears as conditional selection in Problem Solving. The skill is translating "if…then" conditions into constraint relationships and systematically ruling out invalid combinations.
Problem Structure
You are given:
- A pool of n candidates
- A team size requirement (fixed or range)
- A set of inclusion/exclusion rules and conditional constraints
Your task: determine who can or cannot be selected together, or how many valid teams exist.
Types of Conditions
| Condition | Logical Form |
|---|---|
| A and B must both be selected | A ∧ B |
| A and B cannot both be selected | ¬(A ∧ B) → at most one of A or B |
| If A is selected, then B must be selected | A → B |
| If A is selected, then B cannot be selected | A → ¬B |
| At least one of A, B, C must be selected | A ∨ B ∨ C |
| Exactly k women from a group | Count constraint |
Contrapositive
For conditional rules, always derive the contrapositive — it gives an equivalent constraint that may be easier to apply.
If A → B, then ¬B → ¬A. Example: "If Ramesh is selected, Suresh must also be selected." → If Suresh is not selected, Ramesh cannot be selected.
Cascading Constraints
One constraint can trigger others:
- "If A then B" and "If B then C" → If A, then both B and C must be selected.
- Chain the implications before attempting cases.
Feasibility Check
When given a specific team, verify all constraints:
- Check "must include" rules (mandatory members)
- Check "cannot be together" rules (mutual exclusions)
- Check "if...then" rules for every selected member
Counting Valid Teams
- List all constraints
- Identify any mandatory inclusions or exclusions
- Enumerate or eliminate cases systematically
- Apply P&C formulas only after reducing the pool through constraints
Example: From {A,B,C,D,E}, choose 3. Constraints: if A is in, B must be in; C and D cannot both be in.
- Cases where A is in: A+B must both be in → 1 more from {C,D,E} but not C and D together → {A,B,C} or {A,B,E} (not {A,B,D} would be ok too; only exclude {C,D} together). Valid: {A,B,C}, {A,B,D}, {A,B,E} → 3 teams.
- Cases where A is out: choose 3 from {B,C,D,E}, no C&D together → {B,C,E}, {B,D,E}, {C,E,...} wait: {B,C,E}, {B,D,E}, {B,C,D} excluded (C&D), {C,D,E} excluded → 2 valid teams without A. Total = 5.
Common Mistakes
- Forgetting to apply the contrapositive — "if A then B" forbids B being out when A is in
- Treating "cannot both be selected" as "neither can be selected" (it allows one to be selected, just not both)
- Missing cascading effects: a constraint triggered by selecting A may trigger a second constraint
Exam Tips
- For CAT: list all constraints before testing any team; draw a constraint map (arrows for implications)
- Derived implications: write them all down — "A in → B in → C out" gives more constraints than just the direct clue
- Test each answer choice against all constraints (for MCQ questions)
- For "how many teams" questions: use case branching — branch on the most constrained member first
- Negative constraints ("X not with Y") reduce the feasible pool — eliminate those combinations early
CAT PYQ Spotlight
Actual CAT questions on this topic
Sign in for full access
Create a free account to access all 12 CAT PYQs on this topic.