MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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?

share|cite|improve this question
up vote 1 down vote accepted

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.

share|cite|improve this answer

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

share|cite|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.