By Fatskills Exam Guides Team — the exam nerds behind 28,500+ quizzes and 2.1M practice questions across 500+ global exams.
Data Insights Study Guide
Two-Part Analysis (TPA) questions on the GMAT Focus Edition test your ability to evaluate paired decisions under simultaneous constraints. You’ll be given a scenario with two interdependent variables (e.g., production quantities, investment allocations, or scheduling choices) and must select one answer from each column that satisfies all given conditions. These questions appear in the Data Insights section and account for ~10-15% of your DI score—mastering them can add 10+ points to your total.
Real-GMAT Example:A company produces two products, X and Y. Each unit of X requires 2 hours of labor and 1 unit of raw material; each unit of Y requires 1 hour of labor and 3 units of raw material. The company has 100 hours of labor and 120 units of raw material available. If the company must produce at least 10 units of X and at least 5 units of Y, what is the maximum number of units of X and Y that can be produced? (Answer choices are paired: e.g., Column A = 30, Column B = 20.)
Pro tip: Graph the inequalities if possible—intersection points are your answer candidates.
Paired Decision Variables
Pro tip: Assign variables (e.g., x = units of X, y = units of Y) and write equations/inequalities.
Feasible Region & Corner Points
Pro tip: Test only the corner points—no need to check every possible value.
Integer Constraints
Pro tip: Round down to the nearest integer if a corner point isn’t whole.
Non-Negativity
Pro tip: Add x ≥ 0, y ≥ 0 to your inequalities.
Substitution for One Variable
Pro tip: Reduces the problem to a single-variable equation.
Testing Answer Choices
Follow these steps for every TPA question:
Note any minimum/maximum requirements (e.g., x ≥ 10, y ≥ 5).
Write Constraints as Inequalities
Include non-negativity (x ≥ 0, y ≥ 0).
Graph or Solve for Intersection Points
If graphing, plot the lines and identify the feasible region.
Test Corner Points
For integer constraints, round down to the nearest whole number.
Check Answer Choices
Eliminate pairs that violate any condition.
Select the Valid Pair
Problem:A bakery makes cakes and pies. Each cake requires 3 cups of flour and 2 eggs; each pie requires 2 cups of flour and 1 egg. The bakery has 60 cups of flour and 40 eggs available. If the bakery must make at least 5 cakes and at least 10 pies, what is the maximum number of cakes and pies it can make? (Answer choices: Column A = Cakes, Column B = Pies)
Step 1: Define Variables- Let c = number of cakes, p = number of pies.- Constraints: c ≥ 5, p ≥ 10.
Step 2: Write Inequalities- Flour: 3c + 2p ≤ 60 - Eggs: 2c + p ≤ 40 - Non-negativity: c ≥ 0, p ≥ 0
Step 3: Find Intersection Points- Solve 3c + 2p = 60 and 2c + p = 40: - From the second equation: p = 40 – 2c. - Substitute into the first: 3c + 2(40 – 2c) = 60 → 3c + 80 – 4c = 60 → -c = -20 → c = 20. - Then p = 40 – 2(20) = 0. But p ≥ 10, so this point is invalid.- Check other corners: - c = 5 (minimum cakes): 3(5) + 2p = 60 → 2p = 45 → p = 22.5 (round down to 22). - Check eggs: 2(5) + 22 = 32 ≤ 40 (valid). - p = 10 (minimum pies): 3c + 2(10) = 60 → 3c = 40 → c ≈ 13.33 (round down to 13). - Check eggs: 2(13) + 10 = 36 ≤ 40 (valid).
Step 4: Test Objective (Maximize c + p)- At (c, p) = (5, 22): 5 + 22 = 27 - At (13, 10): 13 + 10 = 23 - Check another point: c = 10, p = 15: - Flour: 3(10) + 2(15) = 60 (valid). - Eggs: 2(10) + 15 = 35 ≤ 40 (valid). - c + p = 25 (better than 23 or 27? Wait—27 is higher, but check constraints again). - For (5, 22): 2(5) + 22 = 32 ≤ 40 (valid). - For (10, 15): 2(10) + 15 = 35 ≤ 40 (valid). - 27 is the maximum.
Step 5: Check Answer Choices- The valid pair is c = 5, p = 22.- If the choices include (5, 22), select it.
Answer: Column A = 5, Column B = 22.
Correct approach: Write all constraints before solving.
Rounding Incorrectly
Correct approach: Always round down for integer constraints.
Testing Only One Constraint
Correct approach: Verify all constraints for every candidate pair.
Assuming the Intersection Point is Valid
Correct approach: Always check if the intersection satisfies all constraints.
Overcomplicating with Calculus
Avoid it: Assume variables must be whole numbers unless stated otherwise.
Non-Binding Constraints
Avoid it: After solving, check which constraint is binding (e.g., flour runs out first).
Answer Choices That Violate Minimums
Avoid it: Eliminate any pair that violates minimum/maximum requirements.
Time Budget
Question:A farmer plants wheat and corn. Each acre of wheat requires 2 tons of fertilizer and 3 hours of labor; each acre of corn requires 4 tons of fertilizer and 1 hour of labor. The farmer has 100 tons of fertilizer and 90 hours of labor. If the farmer must plant at least 10 acres of wheat and at least 5 acres of corn, what is the maximum number of acres of wheat and corn that can be planted? (Answer choices: Column A = Wheat, Column B = Corn)
Answer: Column A = 20, Column B = 15.Explanation: The binding constraint is labor (3w + c ≤ 90). At w = 20, c = 30 (but fertilizer: 2(20) + 4(30) = 160 > 100). Adjust to w = 20, c = 15 (fertilizer: 2(20) + 4(15) = 100; labor: 3(20) + 15 = 75 ≤ 90).
Join 4M+ learners. Unlock unlimited quizzes, wrong-answer tracking, flashcards + reminders, study guides, and 1-on-1 challenges.