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?



Find both maximum and minimum values in linear programming problem
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.


