972 resultados para Gross revenue


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Report of the Indoor Multipurpose Use and Training Facility Revenue Bond Funds of Iowa State University of Science and Technology as of and for the year ended June 30, 2008

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Report of the Regulated Materials Facility Revenue Bond Funds of Iowa State University of Science and Technology as of and for the year ended June 30, 2008

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Report of the Memorial Union Revenue Bond Funds of Iowa State University of Science and Technology as of and for the year ended June 30, 2008

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Report of the Athletic Facilities Revenue Bond Funds of Iowa State University of Science and Technology as of and for the year ended June 30, 2008

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Agency Performance Plan, Iowa Department of Revenue

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Agency Performance Plan, Iowa Workforce Development

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The Network Revenue Management problem can be formulated as a stochastic dynamic programming problem (DP or the\optimal" solution V *) whose exact solution is computationally intractable. Consequently, a number of heuristics have been proposed in the literature, the most popular of which are the deterministic linear programming (DLP) model, and a simulation based method, the randomized linear programming (RLP) model. Both methods give upper bounds on the optimal solution value (DLP and PHLP respectively). These bounds are used to provide control values that can be used in practice to make accept/deny decisions for booking requests. Recently Adelman [1] and Topaloglu [18] have proposed alternate upper bounds, the affine relaxation (AR) bound and the Lagrangian relaxation (LR) bound respectively, and showed that their bounds are tighter than the DLP bound. Tight bounds are of great interest as it appears from empirical studies and practical experience that models that give tighter bounds also lead to better controls (better in the sense that they lead to more revenue). In this paper we give tightened versions of three bounds, calling themsAR (strong Affine Relaxation), sLR (strong Lagrangian Relaxation) and sPHLP (strong Perfect Hindsight LP), and show relations between them. Speciffically, we show that the sPHLP bound is tighter than sLR bound and sAR bound is tighter than the LR bound. The techniques for deriving the sLR and sPHLP bounds can potentially be applied to other instances of weakly-coupled dynamic programming.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The network choice revenue management problem models customers as choosing from an offer-set, andthe firm decides the best subset to offer at any given moment to maximize expected revenue. The resultingdynamic program for the firm is intractable and approximated by a deterministic linear programcalled the CDLP which has an exponential number of columns. However, under the choice-set paradigmwhen the segment consideration sets overlap, the CDLP is difficult to solve. Column generation has beenproposed but finding an entering column has been shown to be NP-hard. In this paper, starting with aconcave program formulation based on segment-level consideration sets called SDCP, we add a class ofconstraints called product constraints, that project onto subsets of intersections. In addition we proposea natural direct tightening of the SDCP called ?SDCP, and compare the performance of both methodson the benchmark data sets in the literature. Both the product constraints and the ?SDCP method arevery simple and easy to implement and are applicable to the case of overlapping segment considerationsets. In our computational testing on the benchmark data sets in the literature, SDCP with productconstraints achieves the CDLP value at a fraction of the CPU time taken by column generation and webelieve is a very promising approach for quickly approximating CDLP when segment consideration setsoverlap and the consideration sets themselves are relatively small.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This report outlines the strategic plan for Iowa Department of Revenue, goals and mission.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Many dynamic revenue management models divide the sale period into a finite number of periods T and assume, invoking a fine-enough grid of time, that each period sees at most one booking request. These Poisson-type assumptions restrict the variability of the demand in the model, but researchers and practitioners were willing to overlook this for the benefit of tractability of the models. In this paper, we criticize this model from another angle. Estimating the discrete finite-period model poses problems of indeterminacy and non-robustness: Arbitrarily fixing T leads to arbitrary control values and on the other hand estimating T from data adds an additional layer of indeterminacy. To counter this, we first propose an alternate finite-population model that avoids this problem of fixing T and allows a wider range of demand distributions, while retaining the useful marginal-value properties of the finite-period model. The finite-population model still requires jointly estimating market size and the parameters of the customer purchase model without observing no-purchases. Estimation of market-size when no-purchases are unobservable has rarely been attempted in the marketing or revenue management literature. Indeed, we point out that it is akin to the classical statistical problem of estimating the parameters of a binomial distribution with unknown population size and success probability, and hence likely to be challenging. However, when the purchase probabilities are given by a functional form such as a multinomial-logit model, we propose an estimation heuristic that exploits the specification of the functional form, the variety of the offer sets in a typical RM setting, and qualitative knowledge of arrival rates. Finally we perform simulations to show that the estimator is very promising in obtaining unbiased estimates of population size and the model parameters.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper analyzes the behavior of international capital flows by foreign and domestic agents,dubbed gross capital flows, over the business cycle and during financial crises. We show thatgross capital flows are very large and volatile, especially relative to net capital flows. Whenforeigners invest in a country, domestic agents invest abroad, and vice versa. Gross capital flowsare also pro-cyclical. During expansions, foreigners invest more domestically and domesticagents invest more abroad. During crises, total gross flows collapse and there is a retrenchmentin both inflows by foreigners and outflows by domestic agents. These patterns hold for differenttypes of capital flows and crises. This evidence sheds light on the sources of fluctuations drivingcapital flows and helps discriminate among existing theories. Our findings seem consistent withcrises affecting domestic and foreign agents asymmetrically, as would be the case under thepresence of sovereign risk or asymmetric information.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Annual Report of the Iowa Department of Revenue FY2008

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Addendum to Annual Report of the Iowa Department of Revenue FY2008

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The Iowa Department of Revenue Performance Report is presented in accordance with the Accountable Government Act to improve decision-making and increase accountability to stakeholders and citizens of Iowa.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The Iowa Department of Revenue Performance Report is presented in accordance with the Accountable Government Act to improve decision-making and increase accountability to stakeholders and citizens of Iowa.