Business MathematicsNEB 2080 (old course)

Find the maximum value of the objective function G = 8x + 3y subject to x + y 6 3x + y 6 x 2

5

Answer

Solution to the Linear Programming Problem

We are given the objective function and constraints as follows:

Objective Function:

Constraints:

  1. (implicit non-negativity constraints)

Step 1: Rewrite the Constraints in Standard Form

To simplify the problem, we rewrite the inequalities in a more familiar form:

  1. can be rewritten as:

  2. can be rewritten as:

  3. remains unchanged.


Step 2: Find the Feasible Region

The feasible region is the area where all constraints are satisfied. To find the vertices of the feasible region, we solve the system of equations formed by the intersection of the boundary lines.

Intersection of and : Substituting into : So, the intersection point is .

Intersection of and : So, the intersection point is .

Intersection of and : So, the intersection point is .

Intersection with Axes:

  • For , when , .
  • For , when , .
  • For , when , .

The feasible region is bounded by the points:

However, we must verify which of these points satisfy all constraints. Testing :

  • (True)
  • (False)

Thus, is not feasible. The feasible vertices are:


Step 3: Evaluate the Objective Function at Each Vertex

We substitute the feasible vertices into the objective function :

  1. At :

  2. At :

  3. At :


Step 4: Determine the Maximum Value

Comparing the values of at the feasible vertices:

  • at
  • at
  • at

The maximum value of the objective function is 40 at the point .

Discussion

Loading…

More Business Mathematics questions

All Business Mathematics old questions