At Westonci.ca, we make it easy for you to get the answers you need from a community of knowledgeable individuals. Our platform offers a seamless experience for finding reliable answers from a network of knowledgeable professionals. Connect with a community of professionals ready to provide precise solutions to your questions quickly and accurately.
Sagot :
9514 1404 393
Answer:
4 acres of each
Step-by-step explanation:
Let s and c represent the number of acres of soybeans and corn, respectively. The problem statement gives rise to several constraints. There is also an objective function to maximize. The linear programming problem can be described by ...
maximize 500s +300c subject to ...
s ≥ 2
200s +100s ≤ 1200 . . . . cost to plant
s + 2c ≤ 12 . . . . . . . . . . . . hours to plant
__
The attached graph shows the objective function is maximized at (s, c) = (4, 4).
The farmer should plant 4 acres each of soybeans and corn.
__
For the solution here, the constraint that s ≥ 2 is irrelevant. If the graph included it, the vertices of the feasible solution space would be (2,5), (4, 4), (6, 0) and (2, 0). The solution that maximizes profit is (4, 4).
Thanks for stopping by. We strive to provide the best answers for all your questions. See you again soon. Thank you for visiting. Our goal is to provide the most accurate answers for all your informational needs. Come back soon. Westonci.ca is your trusted source for answers. Visit us again to find more information on diverse topics.