DEGREE DEGREE DEGREE A B AVAI SEMB M1 3 5000 M2 6. 6. 10000 N1 8000 N2 10 4000 N3 9. 5 5600 Resource 0.3 0.4 0.5 cost College 13 13 17 Fee Resource table
1. Choose the Objective function . ( 45% Marks)
2. Constraints for tutor M1 (10% Marks)
3. Constraints for tutor M2 ( 10% Marks)
4. Constraints for tutor N, ( 10% Marks)
5. Constraints for tutor N2. ( 10% Marks)
6. Constraints for tutor N3 ( 10% Marks)
7. Remaining constraints. ( 5% Marks)
2. A college offers produces three different degrees, A, B and C. Each Student needs to attend and examined by two departments M and N. Department has two tutors teaching the modules M. and Ms, while N has three tutors teaching the modules Nu, N, and Ns. Degree A can be awarded to any student who passes any one module examinations in the departments M and one module in department N. Degree B can be awarded to any student who passes any one module in department M and module N, in department N. Degree C can be awarded to any student who passes the module M, in department M and module Ns in department N. Time taken to award a degree to one student from each department is given in table below. The table also shows total available tutor time per week, module fee is given in table below. The table also shows total available tutoring hours per week, salary to the tutors at full capacity in a week, cost of resources required per student and college fee per degree. How many of each type of degree can be awarded from which department so as to maximize the net profit of the college? Assume that every student passes the module in their first attempt. Formulate the linear programming problem. (Refer Meclearn for #values) Tutors Degree awarded Time available cost of tutors tutoring hour semester per semester full capacity Minutes) M. 5000 250 M 6 10000 500 N 8000 400 N 4000 200 N, 7 5600 280 Resource cost 0.4 0.5 0.3 College Fee 20 22 10 (20 Marks) 2. A college offers produces three different degrees, A, B and C. Each Student needs to attend and examined by two departments M and N. Department has two tutors teaching the modules M. and Ms, while N has three tutors teaching the modules Nu, N, and Ns. Degree A can be awarded to any student who passes any one module examinations in the departments M and one module in department N. Degree B can be awarded to any student who passes any one module in department M and module N, in department N. Degree C can be awarded to any student who passes the module M, in department M and module Ns in department N. Time taken to award a degree to one student from each department is given in table below. The table also shows total available tutor time per week, module fee is given in table below. The table also shows total available tutoring hours per week, salary to the tutors at full capacity in a week, cost of resources required per student and college fee per degree. How many of each type of degree can be awarded from which department so as to maximize the net profit of the college? Assume that every student passes the module in their first attempt. Formulate the linear programming problem. (Refer Meclearn for #values) Tutors Degree awarded Time available cost of tutors tutoring hour semester per semester full capacity Minutes) M. 5000 250 M 6 10000 500 N 8000 400 N 4000 200 N, 7 5600 280 Resource cost 0.4 0.5 0.3 College Fee 20 22 10 (20 Marks)
