System of Linear Inequalities q Linear Programming 2017

System of Linear Inequalities q Linear Programming 2017 1

q Questions: Ø Are there any other representations describing the same set? Ø How can we identify the different representation given a representation of a set? Ø Which are the most important elements in a representation to describe the set and which elements are redundant or unnecessary? Ø Given an instance of a representation, does it have a feasible solution or not? Ø How can we verify that it has a feasible solution or not? Linear Programming 2017 2

q References: Convexity and Optimization in Finite Dimensions 1, Josef Stoer and Christoph Witzgall, 1970, Springer-Verlag. Convex Analysis, R. Tyrrell Rockafellar, 1970, Princeton University Press. Integer and Combinatorial Optimization, George L. Nemhauser, Laurence A. Wolsey, 1988, Wiley. Theory of Linear and Integer Programming, Alexander Schrijver, 1986, Wiley. Linear Programming 2017 3

q Linear Programming 2017 4

q Linear Programming 2017 5

q Linear Programming 2017 6

Convex Sets q Linear Programming 2017 7

q Linear Programming 2017 8

Subspaces q Linear Programming 2017 9

q Linear Programming 2017 10

q Linear Programming 2017 11

q Linear Programming 2017 12

q Linear Programming 2017 13

q Linear Programming 2017 14

q Linear Programming 2017 15

q Picture: Linear Programming 2017 16

q Linear Programming 2017 17

Review q Linear Programming 2017 18

q Linear Programming 2017 19

q Linear Programming 2017 20

Back to subspace q Linear Programming 2017 21

q Linear Programming 2017 22

q Linear Programming 2017 23

q Linear Programming 2017 24

Remarks q Linear Programming 2017 25

q Linear Programming 2017 26

Obtaining constrained form from generators (1, -3, 1) 0 Linear Programming 2017 27

Remarks q Linear Programming 2017 28