Question: If we have a program, min { g ( x ) x S } where S is a polyhedron that does not contain a line

If we have a program, min{g(x)xS} where S is a polyhedron that does not contain a line and g is a function that is concave, prove that if there is an optimal solution then there exists an extreme point of S that is optimal.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!