Given the following balanced transportation problem with the

Given the following (balanced) transportation problem with the objective of minimizing the total transportation cost, Use the northwest comer method to find an initial solution, Is the initial solution optimal? Why or why not? If the initial solution is not optimal, find a new better solution, using the transportation algorithm and present your new solution below.

Solution

Ans-

We establish essentially optimal bounds on the complexity of initial-value problems in the randomized and quantum settings. For this purpose we define a sequence of new algorithms whose error/cost properties improve from step to step. These algorithms yield new upper complexity bounds, which differ from known lower bounds by only an arbitrarily small positive parameter in the exponent, and a logarithmic factor. In both the randomized and quantum settings, initial-value problems turn out to be essentially as difficult as scalar integration.