Checkout
checkout
view
Your Cart Your Cart: item(s)
View Details $1.99 Download Add to Cart

OR Problem

A company assembles motherboards which contain the Enterprise chip. The company uses 9,000 Enterprise chips each year. The supplier of the chips imposes a £5 delivery charge on each order. The chips have to be stored in a freezer resulting in a high holding cost which has been estimated at £0.48 each per month. (a) Determine the optimal order quantity, the time between orders and the annual inventory cost. (b) Determine the difference in annual inventory costs between the optimal policy and the current policy of placing two orders every month. (c) The purchase cost of the Enterprise chip is usually £10 each. However, a new chip is due to be announced shortly and so a discount on the En... click for more

Subject:

Math

Topic:

Operations Research

Posting ID:

10892

OTA ID:

103060

View Details $1.99 Download Add to Cart

Operations Research: North-West Corner Method

Please see the attached file for the fully formatted problem. For the transportation problem given by the following tableau, find an initial basic feasible solution by the North-West corner method and then find an optimal solution. [Tableau]

Subject:

Math

Topic:

Operations Research

Posting ID:

10893

OTA ID:

102862

View Details $1.99 Download Add to Cart

Probability

Please could I have the answer to this: Full workings please. A shortlist of 10 people is drawn up from a large number of applicants for a certain job. The shortlist consists of 7 men and 3 women. Because all the shortlisted applicants are considered to be equally qualified, the names of two of them are drawnn, one after the other at random, to be called for an interview. Determine the probability that: a) Both interviewees are women b) Both interviewees are men c) One interviewee is a man and the other a woman.

Subject:

Math

Topic:

Operations Research

Posting ID:

15601

OTA ID:

101767

View Details $1.99 Download Add to Cart

Dynamic Programming

Please see the attached file for the fully formatted problem. Use Dynamic Programming to solve: 1. Min f(x-bar) = 3x21 + x22 + 2x23 s.t. Sx1 + 2x2 +x3 >= 18 DP Formulation:.... Min s.t. Stage 1: Stage 2: Stage 3:

Subject:

Math

Topic:

Operations Research

Posting ID:

15889

OTA ID:

104312

View Details $1.99 Download Add to Cart

Dynamic Programming - The Allocation Problem

Please see the attached file for the fully formatted problems. The beginning appears below... Example Problem: A sales manager has 3 areas and 5 sales engineers. If the assignment of sales engineers to areas will result in the expected sales as shown, how should the engineers be assigned to maximize sales? Sales (in $K) Area 1 Area 2 Area 3 0 0 0 0 Number of 1 45 20 50 Sales Engineers 2 70 45 70 Assigned 3 ... click for more

Subject:

Math

Topic:

Operations Research

Posting ID:

15961

OTA ID:

103300

Page generated in 0.0455 seconds

About Us ·  Contact Us ·  Samples ·  Solutions ·  Legal Terms and Conditions ·  Privacy Policy

©2008 SolutionLibrary.com

Search for Solutions About Us Samples