Salesman needs to manage stocks in a n periods. Each period i, salesman know that unit cost of the products pi, unit cost ci of selling a product. Unit cost hi of stocking a products during period i. At each period i salesman cannot stock more than B products. The initial and the final stocks are must be zero. End of period i, salesman sales a given number of yi product. The salesman wants to maximize the profit. Model this problem as a flow problem in an appropriately constructed graph.

Answer rating: 100% (QA)

n graph theory a flow network is defined as a directed graph involving a source S and a sink T and s... View the full answer