c. State the # of c-47 and c- 54's the Americans used to maximize their carrying capacity's d. What are the advantages/disadvantages of solving the liner programming problem using the graphing method vs the simplex method? On June 24, 1948, the former Soviet Union blocked all land and water routes through East Germany to Berlin.A gigantic airlift was organized using American and British planes to bring food, clothing, and other supplies tothe more than 2 million people in West Berlin. The Americans had two types of planes available, the C-47Skytrain and the C-54 Skymaster. The carrying capacity was 3.5 tons for a C-47 and 10 tons for a C-54. Tobreak the Soviet blockade, the Western Allies had to maximize carrying capacity, but the Americans werelimited by the following restrictions:No more than 44 planes could be used per day.Each C-47 required 4 crew members per flight and the crew requirement for the C-54 was 5. The totalnumber of personnel available per day could not exceed 200.The Americans only had 32 C-54's available.Find the number of C-47's and C-54's the Americans used to maximize their carrying capacity.Convert each constraint from problem 2 into an equation by adding slack variables and set up the initiala.simplex matrix.b. Perform all pivots necessary using row operations to transform the matrix until the solution is feasible.

Note: Since you have posted a question with multiple sub-parts, we will provide the solution only to…

c. State the # of c-47 and c- 54's the Americans used to maximize their carrying capacity's d. What are the advantages/disadvantages of solving the liner programming problem using the graphing method vs the simplex method?

c. State the # of c-47 and c- 54's the Americans used to maximize their carrying capacity's d. What are the advantages/disadvantages of solving the liner programming problem using the graphing method vs the simplex method?

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

I. Use the Graphical Method to solve the 2 following linear programming problems. 1. Mr. Trenga plans to start a new business called Rivers Explorers, which will rent canoes & kayaks to people to travel 10 miles down the Clarion River in Cook Forest State Park. He has $45,000 to purchase new boats(canoes & kayaks). He can buy canoes for $600 each & kayaks for $750 each. His facility can hold up to 65 boats. The canoes will rent for $25 per day & the kayaks will rent for $30 per day. How many canoes & howmany kayaks should he buy to earn the most revenue (rental income)?
6.2) Solving Linear Programming Problems Graphically RESOURCE ALLOCATION: Your salami manufacturing plant can order up to 1,000 punds of pork and 2,400 pounds of beef per day for use in manufacturing its two specialities: COUNT DRACULA SALAMI and FRANKENSTEIN SAUSAGE. Production of the Count Dracula variety requires 1 pund of pork and 3 punds of beef for each salami, while the Frankenstein variety requires 2 punds of pork and 2 pounds of beef for every sausage. In view of your heavy investment in advertising Count Dracula Salami, you have decided that at least one third of the total production should be Count Dracula. On the other hand, because of the health-concious consumer climate, your Frankenstein Sausage(sold as having less beef) is earning your comapny a profit of $3 per sausage, while sales of the Count Dracula variety are down and it is earning your company only $1 per salami. Given these restrictions, How many of each kind of sausage should you produce to maximize profits,…
Is this constraint linear or able to be included as a constraint in a linear programming problem? 4X1 – (1/3)X2 = 75
Use the simplex method to solve the linear programming problem. X₂ (Type integers or simplified fractions.) OB. There is no maximum. Maximize subject to: Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. OA. The maximum is when X₁ 1, 8₂, and s₂ -. 5₁ = with z = 10x₁ + 18x₂ 6x₁ + 3x₂ $36 5X4 X5 20 3x₁ + 3x₂ ≤42 x₁20, X₂ 20
When deleting a basic variable xBr from the simplex tableau, would it be possible to make xBr nonbasic by pivoting on any non-zero element in row r? What difficulties one might encounter with this approach?
Zmax = 3x1 + 7x2 %3D Subject to 2x1 + 3x2< 6 X1 + X2 < 4 X1 2 0, X2 2 0 In the starting simplex tableau, the basic variables are slack variables. The objective value in the next simplex table is
this is a linear programming problem. one image is the required information and the other image is the question.
Hi, please help me solve this problem consisting of linear programming. Thanks
Linear Programming: I got started on it, please follow up with my solution or give a better one
Please help with A
At Long John Silver’s (LJS), Platter 1 comes with 2 pieces of fish, 3 pieces of chicken, and 5 fried shrimp, while Platter 2 comes with 3 pieces of fish, 1 piece of chicken, and 8 fried shrimp. Platter 1 sells for 8 dollars and platter 2 sells for 10 dollars. If LJS has access to 1000 pieces of fish, 1200 pieces of chicken, and 2600 fried shrimp, what is the optimal number of platters LJS should make in order to maximize its profit? Note that the constraints relate to (please use these in order) fish, chicken, and shrimp. Note that problem 7 had three constraints (excluding the non-negativity constraints), and setting two pairs of those constraints to equality led to two extreme points on the feasible region. What INFEASIBLE point was at the intersection of the other pair of constraints? In the optimal solution to problem 7, the optimum was found at the intersection of two of the constraints that were not non-negativity constraints. Call these “binding” constraints. One of those…