Consider an arbitrary program in standard equation form: maximise c™x subject to Ax = b, x >0 Consider two vectors y and z with y + z and consider two values 0 E [0, 1] and 0' e [0, 1] with 0 # 0'....

Extracted text: Consider an arbitrary program in standard equation form: maximise c™x subject to Ax = b, x >0 Consider two vectors y and z with y + z and consider two values 0 E [0, 1] and 0' e [0, 1] with 0 # 0'. Show that Oy + (1 other words, every distinct way of choosing the value A E [0, 1] gives a distinct convex combination Ay + (1 – X)z. Hint: let a = Oy + (1 – 0)z and b = 0'y + (1 – 0')z, then consider a – b. - 0)z + O'y + (1 – 0')z. In | |