Reference no: EM13362932

Question 1  Solve the following LP using Revised Simplex Method

Minimize z= 2x₁+x₂ subject to 3x₁+4x₂ <= 6, 6x₁ +x₂ < = 3, x₁, x₂ >=0

Question 2  Solve the following transportation problem (Using VAM, Compute initial basic solution).

		Destination				Supply
		I	II	III	IV
Source	A	10	0	20	11	15
	B	12	7	9	20	25
	C	0	14	16	18	5
Demand		5	15	15	10

Question 3      ABC Company has 4 types of jobs to be performed by 4 type of workers with varying skill and hence wages. Depending on the skill of the worker, the wages (in Rs.) per hour for four workers and four jobs are given in the following table.

Worker/job	J1	J2	J3	J4
W1	5	7	11	6
W2	8	5	9	6
W3	4	7	10	7
W4	10	4	8	3

Using the above tableau, find out the optimal assignment of job to each worker. Also find out the optimal cost of performing the jobs.

Question 4      The table below lists all the activities and their respective durations for a small engineering activity

Activity	1-2	2-3	2-4	3-4	3-5	3-6	4-5	4-6	5-6
Duration (weeks)	3	3	2	0	3	2	7	5	6

For the above table:

(i)      Construct the network showing all the possible paths

(ii)    Find the critical path showing each activity's start and finish time.

 

Question 5      There are two products A and B, each product requires time in 2 production department 1 & 2. Product A requires 6 hours in department 1 and 3 hours in department 2. Product B requires 3 hours in department 1 and 6 hours in department 2. Production time is limited in department 1 to 90 hours and in department 2 to 72 hours. Contribution to the profits for the two products is Rs. 120 and Rs. 90 per unit respectively.

(i)  If the total desired profit is Rs 21,000, formulate the Goal programming model for the above.

(ii)  If the company sets two equally ranked goal one to achieve the profit of Rs. 15000 and the other to meet the production goal of product A as 10 units. Reformulate the goal programming model.