[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math

View post   
File: 29 KB, 512x384, 1319478074186.jpg [View same] [iqdb] [saucenao] [google]
6151210 No.6151210 [Reply] [Original]

"Prove, in general, that any line segment connecting two distinct optimal solutions of a canonical linear programming problem is an optimal solution"

So where do i go with this?

Do i define 2 optimal solutions, and use the definition of a line segment and show that a point on this line segment is convex?

Or am i nowhere near?

Pic unrelated