This document provides an assignment sheet for a Design of Transmission Systems course. It includes:
1) A linear programming problem to maximize an objective function subject to constraints using the simplex method.
2) An assignment problem to maximize total profit by assigning 5 persons to 5 registration counters.
3) A job scheduling problem involving 9 jobs that must be processed on machines P and Q, providing the processing times.
This document provides an assignment sheet for a Design of Transmission Systems course. It includes:
1) A linear programming problem to maximize an objective function subject to constraints using the simplex method.
2) An assignment problem to maximize total profit by assigning 5 persons to 5 registration counters.
3) A job scheduling problem involving 9 jobs that must be processed on machines P and Q, providing the processing times.
This document provides an assignment sheet for a Design of Transmission Systems course. It includes:
1) A linear programming problem to maximize an objective function subject to constraints using the simplex method.
2) An assignment problem to maximize total profit by assigning 5 persons to 5 registration counters.
3) A job scheduling problem involving 9 jobs that must be processed on machines P and Q, providing the processing times.
Semester: I Dept: Mechanical Engg Name of the program: B.Tech Year: IV Section: A & B Course/Subject: Design of Transmission Systems Course Code: 18MEMET7010 Name of the Faculty: B. Krishna Murthy Designation: Asst. Professor
S.No. QUESTION CO BTL
Use simplex method to solve the following problem: 1 Maximize Z= 3X1+2 X2+ 5X3, CO1 BTL2 Subject to X1+ X2+ X3≤9, 2X1+ 3X2+ 5X3≤30, 2X1-X2-X3≤8, X1, X2, X3≥0 Solve the assignment problem at the head office of a company there are five registration counters. Five persons are available for service. How should the counters be assigned to persons so as to maximize the profit? 2 A B C D E CO2 BTL2 1 30 37 40 28 40 2 40 24 27 21 36 3 40 32 33 30 35 4 25 38 40 36 36 5 29 62 41 34 39 There are nine jobs, each of which must go through two machines P and Q in the order PQ, the processing times (in hours) are given below: 3 Job(s) CO3 BTL3 Machine A B C D E F G H I P 2 5 4 9 6 8 7 5 4 Q 6 8 7 4 3 9 3 8 11