STATEMENT OF ORIGINALITY:

I (we) certify that this piece of in-course assignment is my (our) own work, that it has not been
copied from elsewhere, and that any extracts from books, papers, websites, journals, or any
other sources have been properly acknowledged as references of quotations.
STUDENT ID SIGNATURE
(can add additional rows if need)

J22038539 Prabhleen Kaur

J22038562

COURSE CODE MAT1215

COURSE NAME FUNDAMNTALS OF MATHEMATICS

SEMESTER/YEAR APRIL 2024

ASSIGNMENT TYPE GROUP ASSIGNMENT

LECTURER’S NAME ANGELINE TAN

SUBMISSION DATE 28 June 2024

WORD COUNT 1085 Words

Comments:
TOTAL /35
(ASSESSOR)
/100
TOTAL Comments:
(REVIEWER /35
) /100

1
A factory produces two types of widgets, plain widget, and ordinary widget. Each widget is
made using three different machines: A, B and C. For the coming week, the factory wants to
decide how many of each plain widget and ordinary widget to produce. Each plain widget needs
15 minutes on machine A, 12 minutes on machine B and 40 minutes on machine C. Each
ordinary widget needs 30 minutes on machine A, 15 minutes on machine B and 20 minutes on
machine C. Machine A is available for 4 hours and 30 minutes a week, machine B for 3 hours a
week and machine C for 9 hours a week. The factory makes a profit of RM 7 on each plain
widget and RM 6 on each ordinary widget.

(a) The factory wants to know how many of each plain widget and ordinary widget should be
produced per week to maximize its net profit. Determine how many plain widgets and
ordinary widgets should be produced to maximize the profit.

To maximize the profit , define the decision variable :

S ¿The number of plain widgets produced per week

P=¿The number of ordinary widgets produced per week
T ¿The total profit in RM

Objective Function :

To maximise T =7 s+6 p

Constraints :
Total available time for each machine:

Machine A : 4 hours 30 minutes =

4 × 60 minutes = 240 minutes
240 minutes + 40 minutes = 270 minutes

Machine B : 3 hours =
3 ×60 minutes = 180 minutes

2
Machine C : 9 hours =
9 × 60 minutes = 540 minutes

S-intercepts , P-intercepts for the constraints :

15 s +30 p≤ 270

s p
18 0
0 9

(18 , 0) (0 , 9)

12 s +15 p ≤ 180
s p
15 0
0 12

(15 , 0)(0 , 12)

40 s+ 20 p ≤ 540
s p
13.5 0
0 27

(13.5 , 0)(0 , 27)

Objective function at each corner point using table :

Corner Points Value of T (T =7 s +6 p) Total

(0 , 10) 7(0)+ 6(10) 60
(10 , 4) 7(10)+6 (4 ) 94
¿, 2 ¿ 7 ¿) +6 (2) 99.5
27 7 ¿ ) +6 (0) 94.5
( ,0¿
2
(0 , 0) 7(0)+ 6(0) 0

3
4
Define the optimal solution(s) and objective value(s) and describe it in a sentence :

The optimal solution occurs at the corner points of the feasible region, where the objective
functionT =7 s+6 p achieves its maximum value. After evaluating all corner points, the
25
maximum profit is RM 99.5 , is achieved at ( , 2).
2

5
(b) If the factory received an order of 2 ordinary widgets, they decided to produce at least 5
ordinary widgets in the coming week. Determine plain widgets and ordinary widgets
should be produced to maximize the profit.

To maximize the profit , define the decision varible :

S=¿ Number of plain widgets produced per week

P=¿Number of ordinary widgets produced per week

Objective Function :

To maximise T =7 s+6 p

Constraints :

15 s +30 p≤ 270
12 s +15 p ≤ 180
40 s+ 20 p ≤540
p ≥5

Non - negative constraints :

s≥0

Objective function at each corner point using table :

Corner Points Value of T (T =7 s +6 p) Total

(8 , 5) 7(8)+ 6(5) 86
(0 , 5) 7(0)+ 6(5) 30
(0 , 9) 7(0)+ 6(9) 54

6
7
8
Define the optimal solution(s) and objective value(s) and describe it in a sentence :

The optimal solution occurs at the corner points of the feasible region, where the objective
functionT =7 s+6 p achieves its maximum value. After evaluating all corner points, the
maximum profit is RM 86 , is achieved at (8 , 5).

9
(c) After a few weeks of observation, the factory found out that the demand for plain widgets
is low and decided to reduce the profit for each plain widget from RM 7 to RM 5.
Assuming that there is no restriction on the number of plain widgets and ordinary widgets
produced, determine how many plain widgets and ordinary widgets should be produced
to maximize the profit.

To maximize the profit , define the decision varible :

S=¿Number of plain widgets produced per week

P=¿Number of ordinary widgets produced per week

Objective Function :

To maximise T =5 s +6 p

Objective function at each corner point using table :

Corner Points Value of T (T =5 s +6 p) Total

(0 , 0) 5(0)+6 (0) 0
(0 , 10) 5(0)+6 (10) 60
(10 , 4) 5(10)+6 (4) 74
25 5 ¿) +6 (2) 74.5
( , 2)
2
¿ ,0¿ 5 ¿) +6 (0) 67.5

Define the optimal solution(s) and objective value(s) and describe it in a sentence :

The optimal solution occurs at the corner points of the feasible region, where the objective
functionT =5 s +6 p achieves its maximum value. After evaluating all corner points, the
25
maximum profit is RM 74.5 , is achieved at ( , 2)
2

10
11