A ship has a single cargo hold which has a weight capacity of 70,000 pounds and a volume capacity of 30,000 cubic feet. The shipowner has contracted to carry loads of packaged beef. The total weight of the available beef is 65,000 pounds; the total weight of the available grain is 75,000 pounds. The volume per mass of the beef is 0.2 cubic foot per pound, and the volume per mass of the grain is 0.4 cubic foot per pound. The profit for shipping beef is $0.35 per pound, and the profit for shipping grain is $0.12 per pound. The shipowner is free to accept all or part of the available cargo; he wants to know how much meat and grain to accept in order to maximize profit. Linear Programming Model
Objective Function (Max or Min):
subject to
Volume:
Weight
Capacity
Beef Weight
Grain Weight
Non-negativity
Optimal Solution:
Beef =
Grain =
Profit = $

step-by-step explanation:

we are given

since, we have to isolate x on anyone side

so, we can move all x terms on one side

subtract both sides by 2x

add both sides by 9

divide both sides by 4

we get

step-by-step explanation:

what are the statements? and what do you mean by "216 2 1 6"?

no oblique asymptote

step-by-step explanation:

to find the oblique asymptote of f(x)

here numerator has degree 1 and denomintor degree 2

degree of numerator < degree of denominator

hence there is no oblique asymptote

when the degree of the denominator > that of the numerator, we saw that the value in the denominator got so much bigger, so quickly,   giving us a horizontal asymptote of the x-axis. or we can write

f(x) = a polynomial of x + a proper fraction.

in this case only we have oblique asymptotes but not when numerator has less degree.

your answer is  

a.

5

step-by-step explanation: