| Article ID: | iaor20043304 |
| Country: | Netherlands |
| Volume: | 32 |
| Issue: | 1 |
| Start Page Number: | 27 |
| End Page Number: | 30 |
| Publication Date: | Jan 2004 |
| Journal: | Operations Research Letters |
| Authors: | Aneja Y.P., Punnen Abraham P. |
We introduce the lexicographic balanced optimization problem (LBaOP) and show that it can be solved efficiently if an associated lexicographic bottleneck problem can be solved efficiently. For special cases of cuts in a graph and base system of a matroid, improved algorithms are proposed. A generalization of LBaOP is also discussed.