let x represent the number of large oak trees. let y represent the number of small oak trees. write an…

let x represent the number of large oak trees. let y represent the number of small oak trees. write an objective function. since profit is to be maximized, write a profit function. monthly profit = (monthly profit to sell x large oak trees) + (monthly profit to sell y small oak trees) monthly profit: z = 35x + 26y. write a system of constraints on the relevant variables. the number of large oak trees cannot be negative. x≥0. the number of small oak trees cannot be negative. y≥0. the monthly demand is at most 330 oak trees. x + y≤330. the nursery does not want to allocate more than $36,400 each month on inventory. part 1 / 8. part 2 of 8.

let x represent the number of large oak trees. let y represent the number of small oak trees. write an objective function. since profit is to be maximized, write a profit function. monthly profit = (monthly profit to sell x large oak trees) + (monthly profit to sell y small oak trees) monthly profit: z = 35x + 26y. write a system of constraints on the relevant variables. the number of large oak trees cannot be negative. x≥0. the number of small oak trees cannot be negative. y≥0. the monthly demand is at most 330 oak trees. x + y≤330. the nursery does not want to allocate more than $36,400 each month on inventory. part 1 / 8. part 2 of 8.

Answer

Explanation:

Step1: Define variables

Let (x) be the number of large oak - trees and (y) be the number of small oak - trees.

Step2: Write the objective function

The profit from selling (x) large oak - trees at a profit of (35) each and (y) small oak - trees at a profit of (26) each is (z = 35x+26y).

Step3: Write the constraints

The total number of oak - trees (x + y) cannot exceed the monthly demand of (330), so (x + y\leq330). Also, the number of large oak - trees (x\geq0) and the number of small oak - trees (y\geq0).

Answer:

Objective function: (z = 35x + 26y) Constraints: (x\geq0), (y\geq0), (x + y\leq330)