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?

MathOverflow is a question and answer site for professional mathematicians. It only takes a minute to sign up.

Sign up to join this community
Anybody can ask a question

Anybody can answer

The best answers are voted up and rise to the top

$\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.

$\begingroup$
$\endgroup$

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

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

.