This document contains three operations research problems involving linear programming and transportation/assignment problems. Problem 1 involves formulating a linear programming problem to maximize profit from manufacturing two products given machine hour constraints and market demand. Problem 2 involves finding the optimal transportation schedule to maximize total profit from supplying three markets from three warehouses given supply and demand amounts. Problem 3 involves finding the optimal assignment of four clerks to four jobs to minimize total cost given the cost matrix, with the constraint that one clerk cannot be assigned to one specific job.
This document contains three operations research problems involving linear programming and transportation/assignment problems. Problem 1 involves formulating a linear programming problem to maximize profit from manufacturing two products given machine hour constraints and market demand. Problem 2 involves finding the optimal transportation schedule to maximize total profit from supplying three markets from three warehouses given supply and demand amounts. Problem 3 involves finding the optimal assignment of four clerks to four jobs to minimize total cost given the cost matrix, with the constraint that one clerk cannot be assigned to one specific job.
This document contains three operations research problems involving linear programming and transportation/assignment problems. Problem 1 involves formulating a linear programming problem to maximize profit from manufacturing two products given machine hour constraints and market demand. Problem 2 involves finding the optimal transportation schedule to maximize total profit from supplying three markets from three warehouses given supply and demand amounts. Problem 3 involves finding the optimal assignment of four clerks to four jobs to minimize total cost given the cost matrix, with the constraint that one clerk cannot be assigned to one specific job.
Attempt any THREE questions Marks : 45 Duration: 1 ½ hr
Q.1. ABC ltd. Manufactures two products P and Q. Profit per unit for P and Q is Rs. 40 and Rs. 80 respectively. One unit of P requires 2 machines hours and one unit of Q requires 3 machines hours. Availability of machine hours is 48. Maximum market demand for P is 15 units and for Q is 10 units. Formulate as LPP and solve by graphical method to obtain maximum total profit. Q.2. A company has 3 warehouses W1, W2 and W3 from where it supplies products to 3 markets M1, M2 and M3. Availability at warehouses is 2000, 1500 and 100 units. Market requirements are 1200, 1800 and 1000 units. Profit potential per unit from each warehouse to each market is as follows: To Profit per unit (Rs.) From M1 M2 M3 W1 25 22 23 W2 15 20 18 W3 18 17 16 Find optimal transportation schedule to maximize total profit. Q.3. The following is the cost matrix (cost in Rs. 1000) of assigning 4 clerks to 4 key purchasing jobs. Clerk 1 cannot be assigned to job 1. Jobs Clerks J1 J2 J3 J4 1 - 5 2 0 2 4 7 5 6 3 5 8 4 3 4 3 6 6 2 Find an Optimal Assignment to minimize total cost. Each clerk can handle only one job. Write an alternate optimal solution if it exists. Q.4. A company has three factories F1, F2 and F3 with supply of 800, 600 and 1000 units respectively. There are four warehouse W1, W2, W3 and W4 with demand of 400, 500, 700 and 800 units respectively. A feasible solution is give below. (With allocations and unit cost data) i. Test the solution for optimally using modified distribution method ii. If the solution is not optimal, find optimal solution by modifying it iii. Find minimum transportation cost To W1 W2 W3 W4 Supply From F1 800 300 12 500 6 20 25 F2 6 11 600 100 500 15 12 F3 9 15 17 1000 200 800 7 Demand 400 500 700 800 2400 2400