@prefix epid: <https://pure.iiasa.ac.at/id/> .
  @prefix void: <http://rdfs.org/ns/void#> .
  @prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
  @prefix cc: <http://creativecommons.org/ns#> .
  @prefix ep: <http://eprints.org/ontology/> .
  @prefix eprel: <http://eprints.org/relation/> .
  @prefix doi: <https://doi.org/> .
  @prefix dc: <http://purl.org/dc/elements/1.1/> .
  @prefix bibo: <http://purl.org/ontology/bibo/> .
  @prefix geo: <http://www.w3.org/2003/01/geo/wgs84_pos#> .
  @prefix owl: <http://www.w3.org/2002/07/owl#> .
  @prefix event: <http://purl.org/NET/c4dm/event.owl#> .
  @prefix skos: <http://www.w3.org/2004/02/skos/core#> .
  @prefix foaf: <http://xmlns.com/foaf/0.1/> .
  @prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
  @prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
  @prefix dct: <http://purl.org/dc/terms/> .

<>
	foaf:primaryTopic <https://pure.iiasa.ac.at/id/eprint/13651>;
	rdfs:comment "The repository administrator has not yet configured an RDF license."^^xsd:string .

<https://pure.iiasa.ac.at/id/eprint/13651#authors>
	rdf:_1 <https://pure.iiasa.ac.at/id/person/ext-AL1124> .

<https://pure.iiasa.ac.at/id/eprint/13651#editors>
	rdf:_1 <https://pure.iiasa.ac.at/id/person/ext-d27418a6f4fee0ef12e53facd0f65f2c>;
	rdf:_2 <https://pure.iiasa.ac.at/id/person/ext-AL1370> .

<https://pure.iiasa.ac.at/id/eprint/13651/>
	dc:format "text/html";
	dc:title "HTML Summary of #13651 \n\nAn alternating method for stochastic linear programming with simple recourse\n\n";
	foaf:primaryTopic <https://pure.iiasa.ac.at/id/eprint/13651> .

<https://pure.iiasa.ac.at/id/eprint/13651>
	<http://www.loc.gov/loc.terms/relators/EDT> <https://pure.iiasa.ac.at/id/person/ext-AL1370>,
		<https://pure.iiasa.ac.at/id/person/ext-d27418a6f4fee0ef12e53facd0f65f2c>;
	bibo:abstract "Stochastic linear programming with simple recourse arises naturally in economic problems and other applications. One way to solve it is to discretize the distribution functions of the random demands. This will considerably increase the number of variables and will involved discretization errors. Instead of doing this, we describe a method which alternates between solving some n-dimensional linear subprograms and some m-dimensional convex subprograms, where n is the dimension of the decision vector and m is the dimension of the random demand vector. In many cases, m is relatively small. This method converges in finitely many steps."^^xsd:string;
	bibo:authorList <https://pure.iiasa.ac.at/id/eprint/13651#authors>;
	bibo:editorList <https://pure.iiasa.ac.at/id/eprint/13651#editors>;
	bibo:status <http://purl.org/ontology/bibo/status/peerReviewed>,
		<http://purl.org/ontology/bibo/status/published>;
	bibo:volume "27";
	dct:creator <https://pure.iiasa.ac.at/id/person/ext-AL1124>;
	dct:date "2009";
	dct:isPartOf <https://pure.iiasa.ac.at/id/repository>;
	dct:publisher <https://pure.iiasa.ac.at/id/org/ext-1c5ddec173ca8cdfba8b274309638579>;
	dct:title "An alternating method for stochastic linear programming with simple recourse"^^xsd:string;
	owl:sameAs <https://doi.org/10.1007/BFb0121120>;
	rdf:type bibo:Article,
		bibo:BookSection,
		ep:BookSectionEPrint,
		ep:EPrint;
	rdfs:seeAlso <https://pure.iiasa.ac.at/id/eprint/13651/> .

<https://pure.iiasa.ac.at/id/org/ext-1c5ddec173ca8cdfba8b274309638579>
	foaf:name "Springer"^^xsd:string;
	rdf:type foaf:Organization .

<https://pure.iiasa.ac.at/id/person/ext-AL1124>
	foaf:familyName "Qi"^^xsd:string;
	foaf:givenName "L."^^xsd:string;
	foaf:name "L. Qi"^^xsd:string;
	rdf:type foaf:Person .

<https://pure.iiasa.ac.at/id/person/ext-AL1370>
	foaf:familyName "Wets"^^xsd:string;
	foaf:givenName "R."^^xsd:string;
	foaf:name "R. Wets"^^xsd:string;
	rdf:type foaf:Person .

<https://pure.iiasa.ac.at/id/person/ext-d27418a6f4fee0ef12e53facd0f65f2c>
	foaf:familyName "Prekopa"^^xsd:string;
	foaf:givenName "A."^^xsd:string;
	foaf:name "A. Prekopa"^^xsd:string;
	rdf:type foaf:Person .