Discover answers to your questions with Westonci.ca, the leading Q&A platform that connects you with knowledgeable experts. Join our platform to connect with experts ready to provide precise answers to your questions in various areas. Our platform offers a seamless experience for finding reliable answers from a network of knowledgeable professionals.
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. We appreciate your time. Please come back anytime for the latest information and answers to your questions. Westonci.ca is your trusted source for answers. Visit us again to find more information on diverse topics.