Glossary
Feasible Region
The feasible region is the set of all points that satisfy every constraint in a linear programming problem at once, shown as a shaded area on a graph. Any point inside it is an allowed solution.
The optimum value of the objective function is always found at one of its corners.
Meaning
The feasible region is the set of all points that satisfy every constraint in a linear programming problem at once, shown as a shaded area on a graph. Any point inside it is an allowed solution.
The optimum value of the objective function is always found at one of its corners.
Where it appears in Add Math
You meet Feasible Region in the Linear Programming chapter of SPM Additional Mathematics. Knowing the term precisely matters in the exam: questions often hinge on reading a keyword correctly, and because SPM marking is analytic, using the right definition in your working helps secure method marks.
Our teachers make sure a student can not only recite what Feasible Region means but use it fluently in a full solution.
The term in three languages
Because the SPM Add Math paper is bilingual (BM/EN), it helps to know this term in each language: Feasible Region (EN) · Rantau Tersaur (BM) · 可行区域 (中文)
Get 1-to-1 help.
Book a Trial Class