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

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Analysis of Sample-Path Optimization

Robinson, Stephen M. · 1996 · Mathematics of Operations Research

Abstract

Sample-path optimization is a method for optimizing limit functions occurring in stochastic modeling problems, such as steady-state functions in discrete-event dynamic systems. It is closely related to retrospective optimization techniques and to M-estimation. The method has been computationally tested elsewhere on problems arising in production and in project planning, with apparent success. In this paper we provide a mathematical justification for sample-path optimization by showing that under certain assumptions—which hold for the problems just mentioned—the method will almost surely find a point that is, in a specified sense, sufficiently close to the set of optimizers of the limit function.

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.1287/moor.21.3.513

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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

Cites

Show all 1 references

Cited by

See all 248

Metadata

Authors
Robinson, S. M.
Venue
Mathematics of Operations Research
Published
1996-08
Volume
21
Issue
3
Pages
513-528
ISSN
  • 0364-765X (ISSN-L)
  • 1526-5471
OpenAlex
W2039000181
Cited by
248
References
1
FWCI
11.62
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: Analysis of Sample-Path Optimization. https://app.cochat.ai/papers/10.1287/moor.21.3.513
The paper
Robinson, S. M. (1996). Analysis of Sample-Path Optimization. Mathematics of Operations Research. https://doi.org/10.1287/moor.21.3.513

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.