5 resultados para Optimal Monetary Policy

em Cochin University of Science


Relevância:

100.00% 100.00%

Publicador:

Resumo:

The present study was an attempt to analyze systematically the techniques of monetary control measures with its relevance and changing importance and to find out their effectiveness in the Indian context especially to achieve the thriving objectives of price stability and economic growth.There is definite and remarkable economic impact of monetary policy on Indian economy in the post-reform period. The importance of monetary policy has been increasing year after year. Its role is very relevant in attaining monetary objectives, especially in managing price stability and achieving economic growth. Along that, the use and importance of monetary weapons like Bank rate, CRR, SLR, Repo rate and Reverse Rate have increased over the years. Repo and Reverse Repo rates are the most frequently used monetary techniques in recent years. The rates are varied mainly for curtailing inflation and absorb the excess liquidity and hence to maintain price stability in the economy. Thus, this short-time objective of price stability is more successful on Indian economy rather than other long-term objectives of development.Monetary policy rules can be active or passive. The passive rule is to keep the money supply constant, which is reminiscent of Milton Friedman’s money growth rule. The second, called a price stabilization rule, is to change the money supply in response to changes in aggregate supply or demand to keep the price level constant. The idea of an active rule is to keep the price level and hence inflation in check. In India, this rule dominates our monetary policy. A stable growth is healthy growth.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Department of Statistics, Cochin University of Science and Technology

Relevância:

30.00% 30.00%

Publicador:

Resumo:

This study is about the analysis of some queueing models related to N-policy.The optimal value the queue size has to attain in order to turn on a single server, assuming that the policy is to turn on a single server when the queue size reaches a certain number, N, and turn him off when the system is empty.The operating policy is the usual N-policy, but with random N and in model 2, a system similar to the one described here.This study analyses “ Tandem queue with two servers”.Here assume that the first server is a specialized one.In a queueing system,under N-policy ,the server will be on vacation until N units accumulate for the first time after becoming idle.A modified version of the N-policy for an M│M│1 queueing system is considered here.The novel feature of this model is that a busy service unit prevents the access of new customers to servers further down the line.It is deals with a queueing model consisting of two servers connected in series with a finite intermediate waiting room of capacity k.Here assume that server I is a specialized server.For this model ,the steady state probability vector and the stability condition are obtained using matrix – geometric method.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

In this thesis we have developed a few inventory models in which items are served to the customers after a processing time. This leads to a queue of demand even when items are available. In chapter two we have discussed a problem involving search of orbital customers for providing inventory. Retrial of orbital customers was also considered in that chapter; in chapter 5 also we discussed retrial inventory model which is sans orbital search of customers. In the remaining chapters (3, 4 and 6) we did not consider retrial of customers, rather we assumed the waiting room capacity of the system to be arbitrarily large. Though the models in chapters 3 and 4 differ only in that in the former we consider positive lead time for replenishment of inventory and in the latter the same is assumed to be negligible, we arrived at sharper results in chapter 4. In chapter 6 we considered a production inventory model with production time distribution for a single item and that of service time of a customer following distinct Erlang distributions. We also introduced protection of production and service stages and investigated the optimal values of the number of stages to be protected.