Constructing the set of efficient objective values in multiple objective linear programs
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- J. Fülöp & L. D. Muu, 2000. "Branch-and-Bound Variant of an Outcome-Based Algorithm for Optimizing over the Efficient Set of a Bicriteria Linear Programming Problem," Journal of Optimization Theory and Applications, Springer, vol. 105(1), pages 37-54, April.
- Harold P. Benson & Serpil Sayin, 1997. "Towards finding global representations of the efficient set in multiple objective mathematical programming," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(1), pages 47-67, February.
- Jacinto Martín & Concha Bielza & David Ríos Insua, 2005. "Approximating nondominated sets in continuous multiobjective optimization problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(5), pages 469-480, August.
- Benson, Harold P. & Sun, Erjiang, 2002. "A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program," European Journal of Operational Research, Elsevier, vol. 139(1), pages 26-41, May.
- Gallagher, Richard J. & Saleh, Ossama A., 1995. "A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program," European Journal of Operational Research, Elsevier, vol. 80(1), pages 204-212, January.
- H. P. Benson, 1998. "Hybrid Approach for Solving Multiple-Objective Linear Programs in Outcome Space," Journal of Optimization Theory and Applications, Springer, vol. 98(1), pages 17-35, July.
- Dauer, Jerald P. & Gallagher, Richard J., 1996. "A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs," European Journal of Operational Research, Elsevier, vol. 88(2), pages 368-381, January.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:46:y:1990:i:3:p:358-365. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.