Let(adsbygoogle = window.adsbygoogle || []).push({}); x1, . . . , xkbe feasible solutions of the linear programming problem:

Maximize z =(c^t)*xsubject toAx< =bandx >= 0,

so fori= 1, . . . , k,Axi<=bandxi>=0,

Letvbe any convex linear combination ofx1, . . . , xk.

i want to show thatvis also a feasible solution of the problem..does anyone know how to show this

**Physics Forums | Science Articles, Homework Help, Discussion**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Feasible solution

**Physics Forums | Science Articles, Homework Help, Discussion**