All published worksheets from http://sagenb.org
Image: ubuntu2004
4b
Finding the equation that forms between two lines: Insert x values in the X list and their associated y values at the same index in the Y list. They must be in either clockwise or counterclockwise order.
Finding Inequalities: Since the origin is not in conv(P) we can use it to find the correct direction of the inequality sign for each equation creating conv(P). Equations 2,3 and 4 must include (0,0) in their inequality and equations 1 and 5 must exclude it. So we will use the opposite sign that appears in the algorithm below for equations 1 and 5, and the same sign for equations 2,3 and 4.
For example with equation 1: (0)-4(0) ? -3 → 0 ? -3. Equation 1 must exlude (0,0) so we want the ? to make that statement incorrect (this would imply "the shading" would be on the opposite side that (0,0) is on. So we see 0 > -3 which means the sign we will use in this equation is ≤. See Problem 4 written sheet for final linear equalities that define conv(P).
4c
Finding an objective function for each extreme point which makes it the unique optimal solution of some linear program.
We can find a line that goes through a point vj with a normal vector of vj as well. Below is using the general method for the points of our bounded polyhedron. See the written sheet for the general form for 4d.
So:
For point (1,1): m < 1/4
For point (2,5): -1/2 < m/d < 1/2
For point (4,6): -3/2 < m/d< 1/2
For point (6,3): -1/2 < m /d< 2/5
For point (5,2): -1 < m /d< 1/4