Edexcel D1 2004 January — Question 1

Exam BoardEdexcel
ModuleD1 (Decision Mathematics 1)
Year2004
SessionJanuary
TopicNetwork Flows

  1. Define the terms
    1. bipartite graph,
    2. alternating path,
    3. matching,
    4. complete matching.
    5. A three-variable linear programming problem in \(x , y\) and \(z\) is to be solved. The objective is to maximise the profit P . The following tableau was obtained.
    Basic variable\(x\)\(y\)\(z\)\(r\)\(s\)\(t\)Value
    \(s\)30201\(- \frac { 2 } { 3 }\)\(\frac { 2 } { 3 }\)
    \(r\)40\(\frac { 7 } { 2 }\)108\(\frac { 9 } { 2 }\)
    \(y\)5170037
    P30200863