Scribd
Upload
24 views

Activity-Maximization Problem

This document summarizes solving a linear programming problem to maximize an objective function of Z = 6x + 8y subject to the constraints that x < 12, y < 10, and 2x + 3y < 36. The feasible region is plotted on a graph and the objective function is evaluated at the corner points, finding the maximum value of 104 occurs at coordinate (12, 4).

Uploaded by

Gregory Adams
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
24 views

Activity-Maximization Problem

This document summarizes solving a linear programming problem to maximize an objective function of Z = 6x + 8y subject to the constraints that x < 12, y < 10, and 2x + 3y < 36. The feasible region is plotted on a graph and the objective function is evaluated at the corner points, finding the maximum value of 104 occurs at coordinate (12, 4).

Uploaded by

Gregory Adams
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 7

ANSWER TO Asynchronous Activity-Maximization

Problem
Problem:
Solve the following linear programming problem
using graphical method.

Maximize Z = 6x + 8y
Subject to:
x < 12
y < 10
2x + 3y < 36

x, y > 0
Given:
The objective function is:
Maximize Z = 6x + 8y
Structural Constraints:
Equation #1: x < 12
Equation #2: y < 10
Equation #3: 2x + 3y < 36

x,y > 0
Solution:
1) Find the points of Equation #3: 2x + 3y < 36
Let x = 0 Let y = 0
2(0) + 3y = 36 2x + 3(0) = 36
0 + 3y = 36 2x + 0 = 36
y = 36/3 x = 36/2
y = 12 x = 18
Point: (0, 12) Point : (18, 0)

2) x = 12

3) y = 10

THEN PLOT THE POINTS:


2x+3y < 36
Y axis X < 12
12
(0,12)
11
(0,10)
10
9
Y < 10
8
7
6
5
FEASIBLE REGION
4
3
2
1
(12,0) (18,0)
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 X axis
4) Then compute the points in the intersections

Substitute: x < 12 and y < 10 from 2x + 3y < 36 in


order to determine the points in the intersection
Solution: a) 2(12) + 3y = 36
24 + 3y = 36
3y = 36 – 24
y = 12/3
y = 4 (12, 4)
b) 2x + 3(10) = 36
2x + 30 = 36
2x = 36 – 30
x = 6/2
x = 3 (3, 10)
2x+3y < 36
5. Y axis X < 12
12
(0,12)
11
(0,10) (3,10)
10
9
Y < 10
8
7
6
5
FEASIBLE REGION (12,4)
4
3
2
1
(12,0) (18,0)
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 X axis
6) Substitute the coordinates at the extreme points of the feasible
region in the objective function.
Objective function: Maximize Z = 6x + 8y
Extreme Points:
(0,10) = 6(0) + 8(10) = 80
(3,10) = 6(3) + 8(10) = 98
(12,4) = 6(12) + 8(4) = 104
(12, 0) = 6(12) + 8(0) = 72
7) Optimal Solution:
Coordinate (12, 4) gives the highest value of 104.

You might also like