Hi all. I have a linear programming problem where I need to find both maximum and minimum values of the objective function. The optimal points are not relevant.
Is there an efficient way to do so?
Add a comment
|
2 Answers
$\begingroup$
$\endgroup$
You can certainly construct problems where the active constraints for the maximum are disjoint from the active constraints for the minimum, so this is as hard as separately solving for max and min.
answered Aug 10, 2012 at 23:48
$\begingroup$
$\endgroup$
Probably not much more efficient than finding the max and min solutions separately.
