A famine relief effort is being mounted and there are three types of food bundles that can be flown out during each delivery. Bundle 1 has 4 kg. of flour, 4 kg. of sugar and 12 litres of water. Bundle 2 has 12 kg. of flour, 4 kg. of sugar and 4 litres of water and Bundle 3 has 8 kg. of flour, 8 kg. of sugar and 8 litres of water. The relief agency has 5200 kg. of flour, 3120 kg. of sugar and 6000 litres of water for each shipment. Bundle 1 can provide for 10 people between deliveries, Bundle 2 for 8 people and Bundle 3 for 11 people. How many bundles of each type should the relief agency send on each flight in order to maximize the number of people being fed. Do this problem by setting up a linear programming problem and determining the vertices of the feasibility set. Enter the number of bundles of types 1, 2, and 3 (in that order) into the answer box below, separated with commas.

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 show step-by-step solution and do not skip steps. Explain your entire process in great detail. Explain how you reached the answer you did.

 

Problem #5: A famine relief effort is being mounted and there are three types of food bundles that can be flown out during
each delivery. Bundle 1 has 4 kg. of flour, 4 kg. of sugar and 12 litres of water. Bundle 2 has 12 kg. of flour, 4 kg.
of sugar and 4 litres of water and Bundle 3 has 8 kg. of flour, 8 kg. of sugar and 8 litres of water. The relief
agency has 5200 kg. of flour, 3120 kg. of sugar and 6000 litres of water for each shipment. Bundle 1 can provide
for 10 people between deliveries, Bundle 2 for 8 people and Bundle 3 for 11 people. How many bundles of each
type should the relief agency send on each flight in order to maximize the number of people being fed.
Do this problem by setting up a linear programming problem and determining the vertices of the feasibility set.
Enter the number of bundles of types 1, 2, and 3 (in that order) into the answer box below, separated with
commas.
Transcribed Image Text:Problem #5: A famine relief effort is being mounted and there are three types of food bundles that can be flown out during each delivery. Bundle 1 has 4 kg. of flour, 4 kg. of sugar and 12 litres of water. Bundle 2 has 12 kg. of flour, 4 kg. of sugar and 4 litres of water and Bundle 3 has 8 kg. of flour, 8 kg. of sugar and 8 litres of water. The relief agency has 5200 kg. of flour, 3120 kg. of sugar and 6000 litres of water for each shipment. Bundle 1 can provide for 10 people between deliveries, Bundle 2 for 8 people and Bundle 3 for 11 people. How many bundles of each type should the relief agency send on each flight in order to maximize the number of people being fed. Do this problem by setting up a linear programming problem and determining the vertices of the feasibility set. Enter the number of bundles of types 1, 2, and 3 (in that order) into the answer box below, separated with commas.
Expert Solution
steps

Step by step

Solved in 5 steps with 5 images

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,