Index

No.

Topics

Acknowledement

Objective

Introduction

Page

1 5
Part 1

a. i. Mathematical Optimmization
ii. Global maximum and minimum
iii. Local maximum and minimum
b. I-think map - ways to find maximum and
minimum values

2
3
4

Part 2 - Based on question given)

a. Maximum area
b. Largest possible volume

Part 3 - Based on question given

i. Graph sketching
ii. Peak hours and the number of people
iii. Number of people in the mall at 7.30 p.m.
iv. Time when the number of people in the mall
reaches 2570.

Further Exploration - Based on question

given

8
9
10
11

a. Linear programming research

- History
- Application
- Importance
- Examples
b. i. Inequalities and graph based on constrains.
ii. Maximum storage volume
iii. Cost of each combinations
iv. Chosen combination & its reasons.

Reflection
Conclusion
Reference
Rubric

Pierre De Fermat

17 August 1601 12 January 1665