A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors

References

• Armand P., Malivert C. Determination of the efficient set in multiobjective linear programming. J. Optim. Theory Appl. (1991) 70:467–489Crossref, Google Scholar
• Armann R. Solving multiobjective programming problems by discrete representation. Optimization (1989) 20:483–492Crossref, Google Scholar
• Benson H., Sayin S. A face search heuristic algorithm for optimizing over the efficient set. Naval Res. Logist. (1993) 40:103–116Crossref, Google Scholar
• Benson H., Sayin S. Towards finding global representations of the efficient set in multiple objective mathematical programming. Naval Res. Logist. (1997) 44:47–67Crossref, Google Scholar
• Boender C., Caron R. J., McDonald J. F., Kan A. R., Romeijn H., Smith R. L., Telgen J., Vorst A. Shake-and-bake algorithms for generating uniform points on the boundary of bounded polyhedra. Oper. Res. (1991) 39(6):945–954Link, Google Scholar
• CPLEXUsing the CPLEX Callable Library, Version 6.5 (1999) (ILOG Inc., Incline Village, NV) Google Scholar
• Dauer J. Analysis of the objective space in multiple objective linear programming. J. Math. Anal. Appl. (1987) 126:579–593Crossref, Google Scholar
• Dauer J., Saleh O. A representation of the set of feasible objectives in multiple objective linear programs. Linear Algebra Appl (1992) 166:261–275Crossref, Google Scholar
• Dessouky M., Ghiassi M., Davis W. Estimates of the minimum nondominated criterion values in multiple-criteria decision making. Engrg. Costs Production Econom. (1986) 10:95–104Crossref, Google Scholar
• Ecker J., Hegner N., Kouada I. Generating all maximal efficient faces for multiple objective linear programs. J. Optim. Theory Appl. (1980) 30:353–381Crossref, Google Scholar
• Evans J., Steuer R. A revised simplex method for linear multiple objective problems. Math. Programming (1973) 5:54–72Crossref, Google Scholar
• Rockafellar R.Convex Analysis (1970) (Princeton University Press, Princeton, NJ) Crossref, Google Scholar
• Rudin W.Principles of Mathematical Analysis (1976) 3rd(McGraw–Hill, New York) Google Scholar
• Sayin S. An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming. Oper. Res. Lett. (1996) 19:87–94Crossref, Google Scholar
• Sayin S. Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming. Math. Programming (2000) 87:543–560Crossref, Google Scholar
• Smith R. L. Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions. Oper. Res. (1984) 32(6):1296–1308Link, Google Scholar
• Steuer R. Multiple objective linear programming with interval criterion weights. Management Sci (1976) 23(3):305–316Link, Google Scholar
• Steuer R., Harris F. Intra-set point generation and filtering in decision and criterion space. Comput. Oper. Res. (1980) 7:41–53Crossref, Google Scholar
• Yu P., Zeleny M. The set of all nondominated solutions in linear cases and a multicriteria simplex method. J. Math. Anal. Appl. (1975) 49:430–468Crossref, Google Scholar