0
$\begingroup$

I was wondering, how can a dual optimal solution be strictly less than the primal optimal solution under the weak duality?

Is there a simple example of an integer problem exhibiting this behavior?

$\endgroup$
1
  • 2
    $\begingroup$ How do you define the dual of an integer programming problem? $\endgroup$
    – copper.hat
    Nov 19, 2022 at 21:48

0

Reset to default

You must log in to answer this question.

Browse other questions tagged .