LINEAR PROGRAMMING PROBLEM

Consider three programs t1, t, and tz such that tz can start only after t; ends and tz can start only after t2 ends. The number of instructions executed in t1, t2 and t3 are 2,50,000, 1,60,000 and 10,000 respectively. Let the speed of machines executing t1, tz and t3 are m, m2, and m3 instructions per second. Find the speed of the machines such that mi+m2+m3 is minimized and t3 is completed within 100 milisecond of starting t