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
Get step-by-step solutions from verified subject matter experts
