STOCHASTIC PROGRAMS WITH INCOMPLETE INFORMATION.

Aharon Ben-Tal; Eithan Hochman

doi:10.1287/opre.24.2.336

STOCHASTIC PROGRAMS WITH INCOMPLETE INFORMATION.

Aharon Ben-Tal^*
, Eithan Hochman

^*Corresponding author for this work

Department of Environmental Economics and Management

Research output: Contribution to journal › Article › peer-review

18 Scopus citations

Abstract

This paper treats a simple recourse problem. Considered is the problem of reducing the feasible set into a smaller efficient set when partial information about the random parameters is known. The authors analyze some examples and give applications to stochastic programs with complete information.

Original language	English
Pages (from-to)	336-347
Number of pages	12
Journal	Operations Research
Volume	24
Issue number	2
DOIs	https://doi.org/10.1287/opre.24.2.336
State	Published - 1976

Access to Document

10.1287/opre.24.2.336

Cite this

@article{2a909fd290504c55b3e142c247eb1a17,

title = "STOCHASTIC PROGRAMS WITH INCOMPLETE INFORMATION.",

abstract = "This paper treats a simple recourse problem. Considered is the problem of reducing the feasible set into a smaller efficient set when partial information about the random parameters is known. The authors analyze some examples and give applications to stochastic programs with complete information.",

author = "Aharon Ben-Tal and Eithan Hochman",

year = "1976",

doi = "10.1287/opre.24.2.336",

language = "אנגלית",

volume = "24",

pages = "336--347",

journal = "Operations Research",

issn = "0030-364X",

publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",

number = "2",

}

TY - JOUR

T1 - STOCHASTIC PROGRAMS WITH INCOMPLETE INFORMATION.

AU - Ben-Tal, Aharon

AU - Hochman, Eithan

PY - 1976

Y1 - 1976

N2 - This paper treats a simple recourse problem. Considered is the problem of reducing the feasible set into a smaller efficient set when partial information about the random parameters is known. The authors analyze some examples and give applications to stochastic programs with complete information.

AB - This paper treats a simple recourse problem. Considered is the problem of reducing the feasible set into a smaller efficient set when partial information about the random parameters is known. The authors analyze some examples and give applications to stochastic programs with complete information.

UR - https://www.scopus.com/pages/publications/0016930015

U2 - 10.1287/opre.24.2.336

DO - 10.1287/opre.24.2.336

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0016930015

SN - 0030-364X

VL - 24

SP - 336

EP - 347

JO - Operations Research

JF - Operations Research

IS - 2

ER -

STOCHASTIC PROGRAMS WITH INCOMPLETE INFORMATION.

Abstract

Access to Document

Other files and links

Fingerprint

Cite this