Question

In: Accounting

Problem 4.2                                         &n

Problem 4.2

                                                   Open-to-Buy Problem

Jane buys men’s sport shirts. She is in the process of estimating her June and July open to buy. As of June 10, she has actual stock on hand of $1,543,768. Jane’s area has had sales of $235,333 (against total June planned sales of $638,950). Total June markdowns of $25,238 (out of a plan of $75,862) have also been taken. The current on-order for June is $115,338, of which Jane expects that $15,000 will not arrive until July. Likewise, of the July on order of 20,432 she expects $12,000 to arrive in June. The June EOM plan is $1,210,562. Before calculating her OTB Jane decides that, if she is overbought, she will return $36,000 worth of knit shirts to one of her vendors for credit.

The July sales plan is $433,985 while the July markdown budget is $65,666. She expects $2,000 of the July on order to be past due. Likewise, she expects that $3,000 of the August on-order will arrive in July. The July EOM plan is $722,500.

Use the attached OTB worksheet to estimate Jane’s total open-to-buy for June and July.

                               Table 8

         Estimated OTB for the Month of                                

Category

Amount

Stock on Hand (as of              )

$

Remaining On-Order

Total Liability

Remaining Sales

Remaining Markdowns

Estimated Past Due

Estimated Early Ships

Estimated EOM

EOM Plan

Over/Under Bought

Adjustments

Adjusted OTB

Adjusted Estimated EOM

            Table 9

         Estimated OTB for the Month of                                

Category

Amount

Estimated BOM

On-Order

Total Liability

Planned Sales

Planned Markdowns

Estimated Past Due

Estimated Early Ships

Prior Month Past Due

Prior Month Early Ships

Estimated EOM

EOM Plan

Over/Under Bought

Adjustments

Adjusted OTB

Adjusted Estimated EOM

Solutions

Expert Solution


Related Solutions

Problem FIVE:                                        &n
Problem FIVE:                                                                               Form B The distribution of weights for 18 year old high school males in the Toledo area can be approximated by a Normal Curve with Mean weight of 173 pounds and Standard Deviation of 15.0 pounds. a…..What is the probability that a randomly selected student is somewhere between 170 and 175 pounds? b…..What is the probability that a randomly selected sample of 100 students had a mean weight between 170 and             175 pounds? c…..What weight would put...
*****This is for BA 381 NEED THIS TONIGHT!!!***** Case Problem 4.2 Greening Product Design Hal Parker...
*****This is for BA 381 NEED THIS TONIGHT!!!***** Case Problem 4.2 Greening Product Design Hal Parker was not convinced that customers cared about green design. “Sure, if it reduces their power consumption, they care, but using less resources to produce the product or using recycled raw materials to begin with? I think our efforts are wasted there.” “But doesn't that save us money in the long run?” commented Sasha Minolta, the finance director. “If we're in business that long to...
Please respond to the following problems from Chapter 4 found in section 4.9: Problem 4.2: You...
Please respond to the following problems from Chapter 4 found in section 4.9: Problem 4.2: You are forced with making a decision on a large capital investment proposal. The capital investment amount is $640,000. Estimate annual revenue at the end of each in the eight year study period is $180,000. Estimated annual year-end expenses are $42,000 starting in year 1. These expenses begin decreasing by $4,000per year at EOY 4 and continue decreasing through EOY 8. Assuming a $20,000 market...
Use the following information for the problem.                ____________________________________________________            &n
Use the following information for the problem.                ____________________________________________________                State of        Probability of              Returns if State Occurs                Economy      State of Economy       Stock S          Stock T ____________________________________________________                Boom           0.10                            12%                 4%                Normal         0.65                          9%                   6%                Recession     0.25                          2%                   9%                ____________________________________________________       a)   Find the expected return of each stock. Use at least seven decimal places in computations of (b), (c) and (d) below to avoid significant...
Problem 1 1.1 If A is an n x n matrix, prove that if A has...
Problem 1 1.1 If A is an n x n matrix, prove that if A has n linearly independent eigenvalues, then AT is diagonalizable. 1.2 Diagonalize the matrix below with eigenvalues equal to -1 and 5. 0 1   1   2 1 2 3 3 2 1.3 Assume that A is 4 x 4 and has three different eigenvalues, if one of the eigenspaces is dimension 1 while the other is dimension 2, can A be undiagonalizable? Explain. Answer for all...
The N-QUEENS PROBLEM Given a chess board having N x N cells, we need to place...
The N-QUEENS PROBLEM Given a chess board having N x N cells, we need to place N queens in such a way that no queen is attacked by any other queen. A queen can only attack horizontally, vertically and diagonally. Let’s go at this one step at a time. let’s place the first Queen at some cell, (I, j) and now the number of unattackable cells are reduced. And now, the number of the Queens to be placed are N...
Problem 3. Throughout this problem, we fix a matrix A ∈ Fn,n with the property that...
Problem 3. Throughout this problem, we fix a matrix A ∈ Fn,n with the property that A = A∗. (If F = R, then A is called symmetric. If F = C, then A is called Hermitian.) For u, v ∈ Fn,1, define [u, v] = v∗ Au. (a) Let Show that K is a subspace of Fn,1. K:={u∈Fn,1 :[u,v]=0forallv∈Fn,1}. (b) Suppose X is a subspace of Fn,1 with the property that [v,v] > 0 for all nonzero v ∈...
Knapsack algorithm problem: Consider the following variation of the Knapsack problem. There are n types of...
Knapsack algorithm problem: Consider the following variation of the Knapsack problem. There are n types of items, let call them 1,2,3,4,...,n. There are exactly c_i copies of item i, and each such copy has value v_i and weight w_i. As before, the knapsack capacity is W, and the other constraint is that you can only take at most c_i copies of item i ( since no more are available). Show how to compute the optimal value that can be achieved...
The n th Triangle Problem Write a code for finding the n th triangle number of...
The n th Triangle Problem Write a code for finding the n th triangle number of triangle sequences: 1, 3, 6, 10, ..., n. That is, your code should accept an integer number, which indicates the triangle levels, and returns how many dots we need to form a triangle with respect to the given level. For example, consider the Fig 1. For n = 3 (can be also written as T3), your code should returns 6. Provide a single program...
Consider the problem of sorting an array A[1, ..., n] of integers. We presented an O(n...
Consider the problem of sorting an array A[1, ..., n] of integers. We presented an O(n log n)-time algorithm in class and, also, proved a lower bound of Ω(n log n) for any comparison-based algorithm. 2. Give an efficient sorting algorithm for an array C[1, ..., n] whose elements are taken from the set {1, 2, 3, 4, 5}.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT