--%>
Assignment Help - homework help

profit-loss based problems

A leather wholesaler supplies leather to shoe companies. The manufacturing quantity requirements of leather differ depending upon the amount of leather ordered by the shoe companies to him. Due to the volatility in orders, he is unable to precisely predict what will be the demand from the shoe companies to him in the coming months. Below is the data he has collected from his monthly order books in the last 3 years:

Quantity of Leather ordered         No. of times this quantity

by shoe companies                      (in kg) was ordered

1200                                                3

1800                                               12

2400                                             10

3000                                              4

3600                                              7

(a) Given the above past data, how much stock should he be prepared to keep available for the next month?

(b) Assume that 1 kg of leather costs him Rs.150/- and he sells it to the shoemakers for a price of Rs.175/-. Also for any excess leather stock in a month that remains, he disposes them off by selling to smaller shops for a price of Rs.140/-. If the demand in the next month turns out to be 1800 kg, what would be his profit/loss?

   Related Questions in Mathematics

  • Q : Bolzano-Weierstrass property The

    The Bolzano-Weierstrass property does not hold in C[0, ¶] for the infinite set A ={sinnx:n<N} : A is infinite; Show that has no “ limit points”.

    		•
  • Q : Pig Game Using the PairOfDice class

    Using the PairOfDice class design and implement a class to play a game called Pig. In this game the user competes against the computer. On each turn the player rolls a pair of dice and adds up his or her points. Whoever reaches 100 points first, wins. If a player rolls a 1, he or she loses all point

    		•
  • Q : Econ For every value of real GDP,

    For every value of real GDP, actual investment equals

    		•
  • Q : What is the definition of a group Group

    Group: Let G be a set. When we say that o is a binary operation on G, we mean that o is a function from GxG into G. Informally, o takes pairs of elements of G as input and produces single elements of G as output. Examples are the operations + and x of

    		•
  • Q : Simulation with Arena An office of

    An office of state license bureau has two types of arrivals. Individuals interested in purchasing new plates are characterized to have inter-arrival times distributed as EXPO(6.8) and service times as TRIA(808, 13.7, 15.2); all times are in minutes. Individuals who want to renew or apply for a new d

    		•
  • Q : Problem on sales and budget XYZ Farm

    XYZ Farm Supply data regarding the store's operations follow: • Sales are budgeted at $480,000 for November, $430,000 for December, and $340,000 for January. • Collections are expected

    		•
  • Q : Profit-loss based problems A leather

    A leather wholesaler supplies leather to shoe companies. The manufacturing quantity requirements of leather differ depending upon the amount of leather ordered by the shoe companies to him. Due to the volatility in orders, he is unable to precisely predict what will b

    		•
  • Q : What is the probability that the film

    T.C.Fox, marketing director for Metro-Goldmine Motion Pictures, believes that the studio's upcoming release has a 60 percent chance of being a hit, a 25 percent chance of being a moderate success, and a 15 percent chance of being a flop. To test the accuracy of his op

    		•
  • Q : First-order formulas over the

    Consider the unary relational symbols P and L, and the binary relational symbol On, where P(a) and I(a) encode that a is apoint and a (sraight) line in the 2-dimensional space, respectively, while On(a,b) encodes  that a is a point, b is a line, and o lies on b.

    		•
  • Q : State Fermat algorithm The basic Fermat

    The basic Fermat algorithm is as follows: Assume that n is an odd positive integer. Set c = [√n] (`ceiling of √n '). Then we consider in turn the numbers c2 - n; (c+1)2 - n; (c+2)2 - n..... until a perfect square is found. If th

    		•