For the standard transportation linear programme with $$m$$ sources and $$n$$ destinations and total supply equaling total demand, an optimal solution (lowest cost) with the smallest number of non-zero $${X_{ij}}$$ values (amounts from source $$i$$ to destination $$j$$) is desired. The best upper bound for this number is

A set of $$5$$ jobs is to be processed on a single machine. The processing time (in days) is given in the table below. The holding cost for each job is Rs. $$K$$ per day.

A schedule that minimizes the total inventory cost is

A steel bar of $$10$$ $$mm\,\, \times \,\,50\,\,mm$$ is cantilevered with two $$M12$$ bolts ($$P$$ and $$Q$$) to support a static load of $$4$$ $$kN$$ as shown in figure aside.

The primary and secondary shear loads on rivet $$p,$$ respectively are

A steel bar of $$10$$ $$mm\,\, \times \,\,50\,\,mm$$ is cantilevered with two $$M12$$ bolts ($$P$$ and $$Q$$) to support a static load of $$4$$ $$kN$$ as shown in figure aside.

The resultant shear stress on rivet $$P$$ is closest to