Changes
Jump to navigation
Jump to search
← Older edit
Newer edit →
Linear programming
(view source)
Revision as of 08:02, 17 June 2022
629 bytes added
,
08:02, 17 June 2022
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
Shobhit
36
edits
Navigation menu
Personal tools
Log in
Namespaces
Page
Discussion
Variants
Views
Read
View source
View history
More
Search
Navigation
Home Page
About us
Help
ಕನ್ನಡ KOER
Subject Portals
Art
English
Hindi हिन्दी
Digital literacy
Mathematics
Science
Social Science
Thematic Portals
Adolescent education
Curriculum, Syllabus and Policy
Education Leadership and Management
Gender
Inclusive Education
Teacher Education
RIESI
30 Day CELT
District Resource Team
Community
STF groups
School Wiki
Diet Wiki
TCOL
Resources
Useful website
Courses
Workshops
Reports
Recent Changes
Statistics
Tools
Special pages
Printable version