36
edits
Changes
Jump to navigation
Jump to search
no edit summary
Line 51:
Line 51:
+
+
+
+
+
+
Geogebra file : https://www.geogebra.org/calculator/qvjg3ntd
Geogebra file : https://www.geogebra.org/calculator/qvjg3ntd
−[[File:Linear programming question 1.png|thumb|Geogebra plot]]
+The area in which all the colors are overlapping represents the region where all these inequalities are satisfied.
+[[File:Linear programming question 1.png|Geogebra plot|center|frameless|777x777px]]
+==== Activity ====
+Plot the area in which all the four inequalities overlap and plot all the vertices of the resulting polygon.
+Geogebra file : https://www.geogebra.org/calculator/qvjg3ntd
+[[File:Linear Programming plot 2 .png|center|frameless|700x700px]]
+==== Observation ====
+Now we have four bounds of this polygon inside of which all the four inequalities are satisfied. All we need to do now is find a point in this set, where <math>x+y</math>is maximised.
+Simply looking at the