- #1

- 32

- 0

**x1, . . . , xk**be feasible solutions of the linear programming problem:

Maximize z =

**(c^t)*x**subject to

**Ax**< =

**b**and

**x >= 0**,

so for

*i*= 1, . . . , k,

**Ax**

**i**

**<=b**and

**x**i

**>=0,**

Let

**v**be any convex linear combination of

**x1, . . . , xk**.

i want to show that

**v**is also a feasible solution of the problem..does anyone know how to show this