Google Classroom
GeoGebraGeoGebra Classroom

Linear Programming Graphical

To solve the LP Problem using the graphical method in GeoGebra: Maximize: f = 2x + y Subject to: c1: x + y <= 2 c2: 2x - 3y <= 2 x, y >= 0 GeoGebra commands for the Task section: c1: x + y <= 2 c2: 2x - 3y <= 2 cx: x >= 0 cy: y >= 0 lc1: x + y = 2 lc2: 2x - 3y = 2 lcx: x = 0 lcy: y = 0 O: Intersect[lcx,lcy] P1: Intersect[lc2,lcy] P2: Intersect[lc2,lc1] P3: Intersect[lc1,lcx] Polygon[O,P1,P2,P3] f: 2x+y f(O) f(P1) f(P2) f(P3) fMax: 2x + y = 3.6

lp001