# GMAT Two-Part Analysis: Scheduling and Constraints | topin

On this page

## Represent rules without adding restrictions

GMAC describes Two-Part Analysis as a versatile quantitative or verbal format assessing relationships, trade-offs and complex problems. These scheduling examples are original. The [general Two-Part guide](/gmat/data-insights/two-part-analysis) covers the shared response list; this article isolates logic constraints and candidate-pair checking.

Turn “A is before B” into A < B in a position order, and “C immediately follows D” into consecutive positions D,C. The first rule allows a gap; the second does not. Many wrong solutions begin by translating an ordinary before relationship as immediate adjacency.

Write exactly the scope of each restriction. “E is not first” says nothing about whether E is last. “F is before G” does not say F is before every other event. Adding an intuitive constraint can remove valid schedules and make a possible position appear mandatory.

Use a small set of slots or an ordered list on permitted notes. Keep the original rule list visible for the final pair check. A diagram is useful only if it preserves every condition; a tidy drawing based on one unstated assumption is a misleading shortcut.

## Original schedule with a uniquely determined middle pair

Five presentations, A, B, C, D and E, occupy positions one to five, one each. A is first. B is before C. D immediately follows C. E is after D. Select the presentation in position three and the presentation in position four from the shared list A, B, C, D, E.

The rules force B < C < D < E, with C,D consecutive, and A already first. Four presentations remain for four ordered positions, so B, C, D and E occupy positions two, three, four and five. Position three is C and position four is D.

Check the selected pair in the entire schedule: A first, B before C, D immediately after C and E later than D. Selecting C for the first column alone is not the whole answer. You must also select D for the second column and place the outputs in the intended order.

This small example is intentionally explicit. It demonstrates the reasoning structure, not official difficulty or a typical number of constraints. Learn the slot method here, then use less restrictive examples to practise recognising when several valid schedules remain.

## Do not confuse one valid schedule with a required schedule

Modify the original rules: A is first, C immediately precedes D, and B is before E. There is no stated relation between the B,E pair and the C,D block. Multiple valid schedules exist, including A,B,C,D,E and A,C,D,B,E.

In the first schedule C is third; in the second C is second. Therefore C could be third, but it is not required to be third. One valid case proves possibility; two valid cases disagreeing on a proposed required position disprove necessity. This distinction often decides the task before any further enumeration.

__Original candidate schedules under the modified rules__
| Schedule  | A first? | C,D consecutive? | B before E? | Valid? |
| --------- | -------- | ---------------- | ----------- | ------ |
| A B C D E | Yes      | Yes              | Yes         | Yes    |
| A C D B E | Yes      | Yes              | Yes         | Yes    |
| A B D C E | Yes      | No               | Yes         | No     |
| A E C D B | Yes      | Yes              | No          | No     |

Read the column headings carefully. “Could be” and “must be” require different proofs, even when they use the same candidate list. Our [yes/no sufficiency guide](/articles/gmat-data-sufficiency-yes-no) uses a related case-testing idea, but always follow the actual Two-Part question’s requested outputs.

For a required-order claim, you can often reason without listing every schedule. Under the modified rules, B is always before E and C always immediately before D. Those relations remain true wherever their blocks sit. By contrast, B being second is not required because A,C,D,B,E is valid. Distinguish a mandated relationship from a mandated absolute position.

Original pairing question: the same modified schedule asks which event could be second and which could be fifth, with the two chosen positions required to occur together. Choosing C second and E fifth works in A,C,D,B,E. C could also be second, and D could separately be fifth, but choosing C second and D fifth together fails because D must immediately follow C. The valid schedules supporting those individual placements are A,C,D,B,E and A,B,E,C,D respectively. Checking individual possibility without the shared schedule can fail the paired task.

After constructing a supporting schedule, read every rule once against that schedule. A convenient arrangement is not evidence of possibility until all constraints pass. If the pair requires two separate incompatible schedules, it does not satisfy a question asking for simultaneous placements.

## Original numerical scheduling example with a shared option list

A training day has a first session lasting x minutes, a ten-minute break and a second session lasting y minutes. Total elapsed time is 130 minutes, and the second session is twice as long as the first. Select first-session and second-session durations from 20, 30, 40, 60, 80 and 100.

The equations are x + 10 + y = 130 and y = 2x. Thus x + y = 120 and 3x = 120, giving x = 40 and y = 80\. Check the actual elapsed total: 40 + 10 + 80 = 130\. The break is part of elapsed time, not a third answer choice.

A pair 60,60 satisfies the session total but fails the ratio. A pair 30,60 satisfies the ratio but produces only 100 minutes including the break. Evaluate both constraints simultaneously rather than allowing one selected answer to satisfy one rule while the other satisfies a different rule.

When the two columns ask independent outputs from a shared list, the same listed value may be correct for both. Do not impose a distinctness rule unless the prompt supplies it. Here distinct values result from the stated ratio, not merely from there being two columns.

## Reduce candidates using the strongest restriction

In an ordering problem, an immediate block is often a useful first representation because it reduces independent placements. In the modified example, treat C,D as one ordered block while considering where B and E fit. Preserve the internal order when expanding the block; D,C is a different and invalid arrangement.

In a numerical problem, use the most restrictive equation first when it eliminates candidates cleanly. The ratio y = 2x narrows the duration pairs before checking elapsed time. Alternatively, solve algebraically as above. Choose the method that gives a complete check with the least unnecessary enumeration.

Keep a rejection reason for the final alternative. If you choose 40,80 over 30,60, write “total including break”. That concise reason helps later review identify whether your decision followed the rules or happened to land on the right pair. Correct guesses are not the same evidence as correct constraint application.

Do not enumerate every possible schedule when a short implication resolves the requested outputs. But if the prompt asks whether a position is required and several schedules remain, you must inspect enough valid cases or derive a general argument. Efficiency should reduce work while preserving the proof, not replace proof with a hunch.

## Practise changing one rule and predicting the effect

Change the break in the duration example to twenty minutes while keeping total 130 and the two-to-one session ratio. Then x + y = 110, so x = 110/3 and y = 220/3\. Those values are not in the original list. That signals the altered exercise needs a compatible list; it does not justify forcing an old pair into the new story.

Change “D immediately follows C” to “D follows C” in a schedule and ask which possibilities are added. Change “B before E” to “B immediately before E” and ask which disappear. These edits teach the difference between ordered relationships and adjacency more directly than copying a solved arrangement.

Our [Multi-Source rule guide](/articles/gmat-multi-source-rules-exceptions) covers another way conditions change outcomes, while [Review and Edit](/articles/gmat-review-edit-strategy) explains how to bookmark a specific unresolved check. A useful note here might be “pair meets total, ratio unchecked”, rather than “hard logic”.

topin’s [free full-length GMAT mock](/gmat/practice-test), marked on the official scale, can test your pair-checking routine under timing. Review wrong responses by the condition missed, column reversed or can/must confusion. A final complete check should verify both selections against every rule, not merely repeat the calculation that produced the first one.

Before submitting, point to each column heading and restate its chosen output. A correct schedule with answers entered in reverse columns does not satisfy the requested response.

## Try a full GMAT mock free

Timed like test day, every section scored, every answer explained.

[Take the free mock ](/gmat/login)

## FAQs

Does “before” mean immediately before?

No. Ordinary before allows intervening events. Adjacency needs wording such as immediately before.

How do I prove something could occur?

Construct one schedule that satisfies every rule and includes the proposed outcome.

How do I disprove a must statement?

Give a valid schedule in which the proposed required outcome does not occur, or show another allowed case.

Can the same option answer both Two-Part columns?

Yes unless the prompt’s constraints rule it out. A shared list does not itself require different choices.

Should I check the answers separately?

Check each column’s meaning, then test the selected pair together against every applicable condition.

## Sources (checked 5 October 2026)

* [mba.com: official Two-Part Analysis purpose and versatility (checked 5 October 2026)](https://www.mba.com/exams/gmat-exam/about/exam-content)

## Related articles

[All GMAT study guides ](/gmat)

* [GMATStudy plans & strategyReview and Edit decisionsUse GMAT Review and Edit with a clear bookmark system, worked correction examples and a practical review budget that protects first-pass completion.Updated 5 Oct 2026](/articles/gmat-review-edit-strategy)
* [GMATStudy plans & strategyChoose section order and breakCompare all six GMAT section orders using fatigue, warm-up and mock evidence, then choose where the optional break fits your actual testing routine.Updated 5 Oct 2026](/articles/gmat-section-order-break-strategy)
* [GMATStudy plans & strategyReverse percentage problemsSolve GMAT reverse percentage and successive-change problems with original worked examples, multiplier equations and checks for discounts, margins and bases.Updated 5 Oct 2026](/articles/gmat-percent-change-reverse-percentages)
* [GMATStudy plans & strategyRates, work and unitsSolve GMAT rates and work problems by tracking units, combining constant rates and handling changing teams, with original questions and checked solutions.Updated 5 Oct 2026](/articles/gmat-rates-work-units)