Example 1
Question: Solve the following linear programming problem graphically: Maximize: \[Z = 3x + 5y\] subject to the constraints: \[x + y \le 120,\quad 3x + y \ge 60,\quad x + 3y \ge 60,\quad x \ge 0,\; y \ge 0.\]
Solution: We first identify the boundary lines and feasible region. Boundary Lines: Line 1: \(x + y = 120\). Two points: \((0, 120)\) and \((120, 0)\). Line 2: \(3x + y = 60\). Two points: \((0, 60)\) and \((20, 0)\). Line 3: \(x + 3y = 60\). Two points: \((60, 0)\) and \((0, 20)\). Feasible Region: We need \(x + y \le 120\) (below or on Line 1), \(3x + y \ge 60\) (above or on Line 2), \(x + 3y \ge 60\) (above or on Line 3), and \(x \ge 0,\; y \ge 0\). Finding Corner Points: Corner A: Intersection of \(3x + y = 60\) and \(x = 0\): \[x = 0 \Rightarrow y = 60.\] So \(A = (0, 60)\). Corner B: Intersection of \(x + y = 120\) and \(x = 0\): \[x = 0 \Rightarrow y = 120.\] So \(B = (0, 120)\). Corner C: Intersection of \(x + y = 120\) and \(y = 0\): \[y = 0 \Rightarrow x = 120.\] So \(C = (120, 0)\). Corner D: Intersection of \(x + 3y = 60\) and \(y = 0\): \[y = 0 \Rightarrow x = 60.\] So \(D = (60, 0)\). Corner E: Intersection of \(3x + y = 60\) and \(x + 3y = 60\). Subtract: \(3x + y - (x + 3y) = 0\) gives \(2x - 2y = 0\), so \(x = y\). Substituting into \(3x + y = 60\): \(4x = 60\), so \(x = 15,\; y = 15\). So \(E = (15, 15)\). We check: \(15 + 15 = 30 \le 120\). Yes, E is feasible. Verify all corners are feasible: - \(A = (0, 60)\): \(0+60=60\le120\); \(0+60=60\ge60\); \(0+180=180\ge60\). Feasible. - \(B = (0, 120)\): \(120\le120\); \(0+120=120\ge60\); \(0+360=360\ge60\). Feasible. - \(C = (120, 0)\): \(120\le120\); \(360+0=360\ge60\); \(120+0=120\ge60\). Feasible. - \(D = (60, 0)\): \(60\le120\); \(180\ge60\); \(60\ge60\). Feasible. - \(E = (15, 15)\): \(30\le120\); \(60\ge60\); \(60\ge60\). Feasible. Evaluating \(Z = 3x + 5y\) at each corner: At \(A = (0, 60)\): \[Z = 3(0) + 5(60) = 300.\] At \(B = (0, 120)\): \[Z = 3(0) + 5(120) = 600.\] At \(C = (120, 0)\): \[Z = 3(120) + 5(0) = 360.\] At \(D = (60, 0)\): \[Z = 3(60) + 5(0) = 180.\] At \(E = (15, 15)\): \[Z = 3(15) + 5(15) = 45 + 75 = 120.\] The maximum value of \(Z\) is 600 at the corner point \(B = (0, 120)\).
Answer: Maximum value of \(Z = 3x + 5y\) is \(600\), attained at \((x, y) = (0, 120)\).
Example 2
Question: Solve the following linear programming problem graphically: Maximize: \[Z = 4x + 3y\] subject to the constraints: \[2x + y \le 180,\quad x + 2y \le 150,\quad x + y \ge 60,\quad x \ge 0,\; y \ge 0.\]
Solution: We identify the boundary lines and feasible region. Boundary Lines: Line 1: \(2x + y = 180\). Points: \((0, 180)\) and \((90, 0)\). Line 2: \(x + 2y = 150\). Points: \((0, 75)\) and \((150, 0)\). Line 3: \(x + y = 60\). Points: \((0, 60)\) and \((60, 0)\). Feasible Region: \(2x + y \le 180\), \(x + 2y \le 150\), \(x + y \ge 60\), \(x \ge 0\), \(y \ge 0\). Finding Corner Points: Corner A: Intersection of \(x + y = 60\) and \(x = 0\): \[x = 0 \Rightarrow y = 60.\] Check: \(2(0)+60=60\le180\); \(0+120=120\le150\). Feasible. So \(A = (0, 60)\). Corner B: Intersection of \(x + 2y = 150\) and \(x = 0\): \[x = 0 \Rightarrow 2y = 150 \Rightarrow y = 75.\] Check: \(0+75=75\le180\); \(0+75=75\ge60\). Feasible. So \(B = (0, 75)\). Corner C: Intersection of \(2x + y = 180\) and \(x + 2y = 150\). From Line 1: \(y = 180 - 2x\). Substitute into Line 2: \[x + 2(180 - 2x) = 150 \Rightarrow x + 360 - 4x = 150 \Rightarrow -3x = -210 \Rightarrow x = 70.\] Then \(y = 180 - 140 = 40\). Check: \(70+40=110\ge60\). Feasible. So \(C = (70, 40)\). Corner D: Intersection of \(2x + y = 180\) and \(y = 0\): \[2x = 180 \Rightarrow x = 90.\] Check: \(90+0=90\ge60\); \(90+0=90\le150\). Feasible. So \(D = (90, 0)\). Corner E: Intersection of \(x + y = 60\) and \(y = 0\): \[x = 60.\] Check: \(120+0=120\le180\); \(60+0=60\le150\). Feasible. So \(E = (60, 0)\). Evaluating \(Z = 4x + 3y\) at each corner: At \(A = (0, 60)\): \[Z = 4(0) + 3(60) = 180.\] At \(B = (0, 75)\): \[Z = 4(0) + 3(75) = 225.\] At \(C = (70, 40)\): \[Z = 4(70) + 3(40) = 280 + 120 = 400.\] At \(D = (90, 0)\): \[Z = 4(90) + 3(0) = 360.\] At \(E = (60, 0)\): \[Z = 4(60) + 3(0) = 240.\] The maximum value of \(Z\) is 400 at the corner point \(C = (70, 40)\).
Answer: Maximum value of \(Z = 4x + 3y\) is \(400\), attained at \((x, y) = (70, 40)\).