Amiya K. Chakravarty

Learn More
We consider several subclasses of the problem of grouping n items (indexed 1, 2, .., n) into m subsets so as to minimize the function g(S1, .. , S,). In general, these problems are very difficult to solve to optimality, even for the case m = 2. We provide several sufficient conditions on g(') that guarantee that there is an optimum partition in which each(More)
We develop and analyze a model of commercial relationship. The commercial chain is assumed to have predcfined boundaries consisting of a manufacturer. a retailer and consumers. We show how cooperation in the chain can be induced so as to maximize total system gain. Our analysis helps resolve issues such as optimal price mark up as the product passes through(More)
We consider several subclasses of the problem of grouping n items (indexed 1, ..., n) into m subsets so as to minimize the function g(S1, ..., S ). In general, these problems are very difficult to solve to optimality, even for the case m = 2 . Here we provide several sufficient conditions on g(-) which guarantee that there is an optimum partition in which(More)