Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 692

The DOI matches its Crossref record.

Multiple-Criteria Decision Making

Yu, Po-Lung · 1985

Abstract

1. Introduction.- 1.1. The Needs and Basic Elements.- 1.2. An Overview of the Book.- 1.3. Notation.- 2. Binary Relations.- 2.1. Preference as a Binary Relation.- 2.2. Characteristics of Preferences.- 2.3. Optimality Condition.- 2.4. Further Comments.- Exercises.- 3. Pareto Optimal or Efficient Solutions.- 3.1. Introduction.- 3.2. General Properties of Pareto Optimal Solutions.- 3.3. Conditions for Pareto Optimality in the Outcome Space.- 3.3.1. Conditions for a General Y.- 3.3.2. Conditions when Y Is ??-Convex.- 3.3.3. Boundedness of Tradeoff and Proper Efficiency.- 3.4. Conditions for Pareto Optimality in the Decision Space.- 3.4.1. Conditions in Terms of Single Criterion Maximization.- 3.4.2. Conditions in Terms of Differentiability.- 3.4.3. Decomposition Theorems of X0(??) and X0(?>).- 3.4.4. An Example.- 3.5. Further Comments.- 3.6. Appendix: Generalized Gordon Theorem.- 3.7. Appendix: Optimality Conditions.- Exercises.- 4. Goal Setting and Compromise Solutions.- 4.1. Introduction.- 4.2. Satisficing Solutions.- 4.2.1. Goal Setting.- 4.2.2. Preference Ordering and Optimality in Satisficing Solutions.- 4.2.3. Mathematical Programs and Interactive Methods.- 4.3. Compromise Solutions.- 4.3.1. Basic Concepts.- 4.3.2. General Properties of Compromise Solutions.- 4.3.3. Properties Related to p.- 4.3.4. Computing Compromise Solutions.- 4.3.5. Interactive Methods.- 4.4. Further Comments.- Exercises.- 5. Value Function.- 5.1. Revealed Preference from a Value Function.- 5.2. Conditions for Value Functions to Exist.- 5.3. Additive and Monotonic Value Functions and Preference Separability.- 5.3.1. Additive and Monotonic Value Functions and Implied Preference Separability.- 5.3.2. Conditions for Additive and Monotonic Value Functions.- 5.3.3. Structures of Preference Separability and Value Functions.- 5.4. Further Comments.- Exercises.- 6. Some Basic Techniques for Constructing Value Functions.- 6.1. Constructing General Value Functions.- 6.1.1. Constructing Indifference Curves (Surfaces).- 6.1.2. Constructing the Tangent Planes and the Gradients of Value Functions.- 6.1.3. Constructing the Value Function.- 6.2. Constructing Additive Value Functions.- 6.2.1. A First Method for Constructing Additive Value Functions.- 6.2.2. A Second Method for Constructing Additive Value Functions.- 6.3. Approximation Method.- 6.3.1. A General Concept.- 6.3.2. Approximation for Additive Value Functions.- 6.3.3. Eigenweight Vectors for Additive Value Functions.- 6.3.4. Least-Distance Approximation Methods.- 6.4. Further Comments.- 6.5. Appendix: Perron-Frobenius Theorem.- Exercises.- 7. Domination Structures and Nondominated Solutions.- 7.1. Introduction.- 7.2. Domination Structures.- 7.3. Constant Dominated Cone Structures.- 7.3.1. Cones and their Polars.- 7.3.2. General Properties of N-Points.- 7.3.3. A Characterization of N-Points.- 7.3.4. Cone-Convexity and N-Points.- 7.3.5. N-Points in the Decision Space.- 7.3.6. Existence, Properness, and Duality Questions.- 7.4. Local and Global N-Points in Domination Structures.- 7.5. Interactive Approximations for N-Points with Information from Domination Structures.- 7.6. Further Comments.- 7.7. Appendix: A Constructive Proof of Theorem 7.3.- Exercises.- 8. Linear Cases, MC- and MC2-Simplex Methods.- 8.1. N-Points in the Linear Case.- 8.2. MC-Simplex Method and Nex-Points.- 8.2.1. MC-Simplex Method and Set of Optimal Weights.- 8.2.2. Decomposition of the Weight Space.- 8.2.3. Connectedness and Adjacency of Nex-Points, and a Method for Locating Nex Set.- 8.3. Generating the Set N from Nex-Points.- 8.3.1. The Need for the Entire Set N.- 8.3.2. Decomposition of the Set N into Nondominated Faces.- 8.3.3. Method to Locate All N-Faces and Examples.- 8.4. MC2-Simplex Method and Potential Solutions in Linear Systems.- 8.4.1. Introduction.- 8.4.2. Potential Solutions of Linear Systems.- 8.4.3. The MC2-Simplex Method.- 8.4.4. Separation, Adjacency, and Connectedness.- 8.4.5. Duality of MC2 Programs.- 8.4.6. An Example.- 8.5. Further Comments.- 8.6. Appendix: Proof of Lemma 8.2.- Exercises.- 9. Behavioral Bases and Habitual Domains of Decision Making.- 9.1. Introduction.- 9.2. Behavioral Bases for Decision Making.- 9.2.1. A Model for Decision/Behavior Processes-Overview.- 9.2.2. Internal Information Processing Center-The Brain.- 9.2.3. Goal Setting, Self-Suggestion, and State Valuation.- 9.2.4. Charge Structures and Significance Ordering of Events.- 9.2.5. Least Resistance Principle, Discharge, and Problem Solving.- 9.2.6. External Information Inputs.- 9.3. Habitual Domains.- 9.3.1. Definition and Formation of Stable Habitual Domains.- 9.3.2. The Expansion of Habitual Domains.- 9.3.3. Interaction of Different Habitual Domains.- 9.3.4. Implications of Studying Habitual Domains.- 9.4. Some Observations in Social Psychology.- 9.4.1. Social Comparison Theory.- 9.4.2. Halo Effect.- 9.4.3. Projection Effect (Assumed Similarity).- 9.4.4. Proximity Theory.- 9.4.5. Reciprocation Behaviors.- 9.4.6. Similarity Eff

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/978-1-4684-8395-6

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 692

Metadata

Authors
Yu, P.-L.
Publisher
Springer US
Published
1985
OpenAlex
W1509479425
Cited by
692
References
0
FWCI
38.20
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Multiple-Criteria Decision Making. https://app.cochat.ai/papers/10.1007/978-1-4684-8395-6
The paper
Yu, P.-L. (1985). Multiple-Criteria Decision Making. https://doi.org/10.1007/978-1-4684-8395-6

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.