Question 3 Assume that 'Refueling Points' could give fuel continuously, meaning one new customer with fuel container could potentially arrive and be serviced every 6 minutes (during steady-state operations): a) What is the minimum number of 'Refueling Points' needed to support “Scenario l"? b) What is the minimum number of 'Refueling Points' needed to support “Scenario 2'?

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question

Please help with question 3 only. 

Note that historical accounts vary on the total number of antiaircraft searchlights used -- either 130 searchlights
("Scenario l") or 150 searchlights (“Scenario 2"). Let's investigate both in a very basic way.
Initial assumptions:
- "Heavy" antiaircraft searchlights characteristics: 990 million candelas (each powered by a 24 kW, 8-cylinder
searchlight generator).
- Each searchlight generator when fully loaded consumes 5 gallons of fuel per hour. The fuel capacity of each
generator is unknown -- let's assume 25 gallons (or 5 hours of fuel).
150-cm-Flakscheinwerfer 34 at the Luftwaffenmuseum
Berlin-Gatow (photo by Denis Apel).
Question 1
a) How much fuel would be consumed (per hour) for "Scenario 1"? (..and how much for 10 hours?)
b) How much fuel would be consumed (per hour) for “Scenario 2'? (..and how much for 10 hours?)
Conveniently a portable fuel container held slightly more than 5 gallons of fuel. Let's assume that a
'refueling event took 12 minutes from the perspective of a fuel container. This means that it took 12 minutes
(roundtrip) to ferry fuel between a 'Refueling Point’ and a searchlight generator, including the time to fill the fuel
container, the time to empty the fuel container, and the back-and-forth transit times. So, a single fuel container
might possibly support at most 5 well-timed 'refueling events' per hour during steady-state operations (we will
risk this assumption for the sake of simplicity).
Question 2
Based on Question 1:
a) What is the steady-state minimum number of fuel containers needed to sustain "Scenario 1"?
b) What is the steady-state minimum number of fuel containers needed to sustain “Scenario 2'?
Next let's assume a safety factor of 1.5 to ensure that sufficient fuel containers are available:
c) What is the revised minimum number of fuel containers needed to sustain “Scenario 1"?
d) What is the revised minimum number of fuel containers needed to sustain “Scenario 2"?
Question 3
Assume that 'Refueling Points' could give fuel continuously, meaning one new customer with fuel
container could potentially arrive and be serviced every 6 minutes (during steady-state operations):
a) What is the minimum number of 'Refueling Points' needed to support “Scenario l"?
b) What is the minimum number of 'Refueling Points' needed to support “Scenario 2'?
Transcribed Image Text:Note that historical accounts vary on the total number of antiaircraft searchlights used -- either 130 searchlights ("Scenario l") or 150 searchlights (“Scenario 2"). Let's investigate both in a very basic way. Initial assumptions: - "Heavy" antiaircraft searchlights characteristics: 990 million candelas (each powered by a 24 kW, 8-cylinder searchlight generator). - Each searchlight generator when fully loaded consumes 5 gallons of fuel per hour. The fuel capacity of each generator is unknown -- let's assume 25 gallons (or 5 hours of fuel). 150-cm-Flakscheinwerfer 34 at the Luftwaffenmuseum Berlin-Gatow (photo by Denis Apel). Question 1 a) How much fuel would be consumed (per hour) for "Scenario 1"? (..and how much for 10 hours?) b) How much fuel would be consumed (per hour) for “Scenario 2'? (..and how much for 10 hours?) Conveniently a portable fuel container held slightly more than 5 gallons of fuel. Let's assume that a 'refueling event took 12 minutes from the perspective of a fuel container. This means that it took 12 minutes (roundtrip) to ferry fuel between a 'Refueling Point’ and a searchlight generator, including the time to fill the fuel container, the time to empty the fuel container, and the back-and-forth transit times. So, a single fuel container might possibly support at most 5 well-timed 'refueling events' per hour during steady-state operations (we will risk this assumption for the sake of simplicity). Question 2 Based on Question 1: a) What is the steady-state minimum number of fuel containers needed to sustain "Scenario 1"? b) What is the steady-state minimum number of fuel containers needed to sustain “Scenario 2'? Next let's assume a safety factor of 1.5 to ensure that sufficient fuel containers are available: c) What is the revised minimum number of fuel containers needed to sustain “Scenario 1"? d) What is the revised minimum number of fuel containers needed to sustain “Scenario 2"? Question 3 Assume that 'Refueling Points' could give fuel continuously, meaning one new customer with fuel container could potentially arrive and be serviced every 6 minutes (during steady-state operations): a) What is the minimum number of 'Refueling Points' needed to support “Scenario l"? b) What is the minimum number of 'Refueling Points' needed to support “Scenario 2'?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,