The DOI matches its Crossref record.
The computational algorithm for the parametric objective function
Abstract
If a linear programming problem involves two objective functions, it is desirable to learn all solutions depending on the relative weight attached to the two functions. This paper presents details of an algorithm which finds these solutions systematically.
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.
Integrity signals
Registry
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.
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
Introduction to Multiobjective Optimization: Noninteractive Approaches
Miettinen, K. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88908-3_1 · Cited by 270
Scalarized multi-objective reinforcement learning: Novel design techniques
Van Moffaert, K., Drugan, M. M., & Nowe, A. (2013) · 2013 IEEE Symposium on Adaptive Dynamic Programming and Reinforcement Learning (ADPRL) · doi:10.1109/adprl.2013.6615007 · Cited by 253
Selection guidelines for wind energy technologies
Olabi, A. G., Wilberforce, T., Elsaid, K., Salameh, T., Sayed, E. T., Husain, K. S., & Abdelkareem, M. A. (2021) · Energies · doi:10.3390/en14113244 · Cited by 108
Metadata
- Authors
- Gass, S., & Saaty, T.
- Venue
- Naval Research Logistics Quarterly
- Publisher
- Wiley
- Published
- 1955-03
- Volume
- 2
- Issue
- 1-2
- Pages
- 39-45
- ISSN
- 0028-1441 (ISSN-L)
- 1931-9193
- OpenAlex
- W2030435702
- Cited by
- 507
- References
- 0
- FWCI
- 6.81
- 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: The computational algorithm for the parametric objective function. https://app.cochat.ai/papers/10.1002/nav.3800020106
- The paper
- Gass, S., & Saaty, T. (1955). The computational algorithm for the parametric objective function. Naval Research Logistics Quarterly. https://doi.org/10.1002/nav.3800020106
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.