Linear Cases, MC- and MC2-Simplex Methods

  • Po-Lung Yu
Part of the Mathematical Concepts and Methods in Science and Engineering book series (MCSENG, volume 30)


We shall discuss some interesting properties of N-points when X is a polyhedron and the constant dominated cone is also polyhedral in Section 8.1. A multiple-criteria (MC) simplex method is then described in Section 8.2 to facilitate the location of N-points. Identification of optimal weights for each nondominated extreme point is also discussed. In Section 8.3 we shall discuss a method to generate all N-points using known extreme N-points. As a natural extension of MC simplex methods, a multiple-criteria and multiple-constraint level (MC2) simplex method is then described in Section 8.4. Potential solutions and duality theory of MC- and MC2-simplex are then discussed. MC- and MC2-simplex methods have been extensively studied by Gal (see Ref. 155) in the context of sensitivity analysis of linear programming problems. Here we use them as tools for locating N-points as well as formulating solution concepts. Note that throughout this chapter we focus on constant dominated cone structures for N-points, unless otherwise specified.


Extreme Point Potential Solution Optimal Weight Simplex Method Nondominated Solution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Suggested Reading

  1. 77.
    Charnes, A., and Cooper, W. W., Management Models and Industrial Applications of Linear Programming, Vol. I, Wiley, New York (1961).Google Scholar
  2. 78.
    Charnes, A., and Cooper, W. W., Management Models and Industrial Applications of Linear Programming, Vol. II, Wiley, New York (1961).Google Scholar
  3. 119.
    Ecker, J. G., and Kouada, I. A., Finding all efficient extreme points for multiple objective linear programs, Math. Program.14, 249–261 (1978).MathSciNetMATHCrossRefGoogle Scholar
  4. 121.
    Ecker, J. G., Hegner, N. S., and Kouada, I. A., Generating all maximal efficient faces for multiple objective linear programs, J. Optim. Theory Appl.30, 353–394 (1980).MathSciNetMATHCrossRefGoogle Scholar
  5. 127.
    Evans, J. P., and Steuer, R. E., A revised simplex method for linear multiple objective programs, Math. Program.5, 54–72 (1973).MathSciNetMATHCrossRefGoogle Scholar
  6. 153.
    Gal, T., RIM Multiparametric linear programming, Manage. Sci.21, 567–575 (1975).MathSciNetMATHCrossRefGoogle Scholar
  7. 155.
    Gal, T., Postoptimal Analyses, Parametric Programming and Related Topics, McGraw-Hill, New York (1979).MATHGoogle Scholar
  8. 156.
    Gal, T., and Nedoma, J., Multiparametric linear programming, Manage. Sci. 18, 406–421 (1972).MathSciNetMATHCrossRefGoogle Scholar
  9. 262.
    Koopmans, T. C., Analysis of production as an efficient combination of activities, in Activity Analysis of Production and Allocation (T. C. Koopmans, ed.), pp. 33–97, Wiley, New York (1951).Google Scholar
  10. 307.
    Mangasarian, O. L., Nonlinear Programming, McGraw-Hill, New York (1969).MATHGoogle Scholar
  11. 406.
    Seiford, L., and Yu, P. L., Potential solutions of linear systems: The multi-criteria multiple constraint levels program, J. Math. Anal. Appl.69, 283–303 (1979).MathSciNetMATHCrossRefGoogle Scholar
  12. 433.
    Steuer, R. E., Adbase/Filter: Computer package for solving multiple objective linear programming problems, University of Kentucky, College of Business and Economics, Lexington, Kentucky, 1977.Google Scholar
  13. 438.
    Stoer, J., and Witzgall, C., Convexity and Optimization in Finite Dimensions I, Springer-Verlag, New York (1970).Google Scholar
  14. 495.
    Yu, P. L., Cone convexity, cone extreme points and nondominated solutions in decision problems with multiobjectives, J. Optim. Theory Appl.14, 319–377 (1974).MATHCrossRefGoogle Scholar
  15. 508.
    Yu, P. L., and Zeleny, M., The set of all nondominated solutions in the linear case and a multicriteria simplex method, J. Math. Anal. App!. 49, 430–468 (1974).MathSciNetCrossRefGoogle Scholar
  16. 509.
    Yu, P. L., and Zeleny, M., Linear multiparametric programming by multicriteria simplex method, Manage. Sci.23, 159–170 (1976).MathSciNetMATHCrossRefGoogle Scholar
  17. 516.
    Zeleny, M., Multiobjective Design of High-Productivity Systems, in Proceedings of the Joint Automatic Control Conference, ASME, New York, New York (1976).Google Scholar

Copyright information

© Plenum Press, New York 1985

Authors and Affiliations

  • Po-Lung Yu
    • 1
  1. 1.University of KansasLawrenceUSA

Personalised recommendations