Assembly line balancing, • Product scheduling problem, Make or buy problems. • Management Applications: Portfolio selection problem, Media selection problem, Profit • planning & Transportation problem. • Miscellaneous Application: Diet problem, Agricultural problem, Flight scheduling problem, • Facilities location problem. Q1.Find solution using graphical method (Maximization) • MAX z = 40x1 + 35x2 • subject to • 2x1 + 3x2 <= 60 • 4x1 + 3x2 <= 96 • and x1, x2 >= 0 The maximum value of the objective function Z = 1000 occurs at extreme point (18, 8) Hence optimal solution to the given LPP problem is X1 = 18, X2 = 8 Q2.Find solution using graphical method (Minimization)
• MIN z = 40x1 + 24x2
subject to 20x1 + 50x2 >= 4800 80x1 + 50x2 >= 7200 and x1,x2 >= 0 The minimum value of the objective function Z = 3456 occurs at the extreme point (0,144). Hence the optimal solution to the given LPP is X1 = 0, X2 = 144