Consider the discrete optimization problem The feasible set consists of a finite collection of m points in

Question:

Consider the discrete optimization problem

image text in transcribed

The feasible set consists of a finite collection of m points in Rn, and we have one inequality constraint. Dualize the inequality and show that the dual function is a piecewise linear, nondifferentiable concave function. Where is the dual function not differentiable?

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: