0
$\begingroup$

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?

Improve this question
$\endgroup$

2 Answers 2

Reset to default
1
$\begingroup$

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.

Improve this answer
$\endgroup$
2
$\begingroup$

Probably not much more efficient than finding the max and min solutions separately.

Improve this answer
$\endgroup$

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .