<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01347538</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-21T06:00:18+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Harvesting in Stochastic Environments: Optimal Policies in a Relaxed Model</title>
            <author role="aut">
              <persName>
                <forename type="first">Richard</forename>
                <forename type="middle">H.</forename>
                <surname>Stockbridge</surname>
              </persName>
              <email type="md5">18f170d2098b85087efeb59905b0a4d2</email>
              <email type="domain">uwm.edu</email>
              <idno type="idhal" notation="numeric">978254</idno>
              <idno type="halauthorid" notation="string">1007451-978254</idno>
              <affiliation ref="#struct-303532"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Chao</forename>
                <surname>Zhu</surname>
              </persName>
              <email type="md5">311ac496b54c238126519dfabfa1b024</email>
              <email type="domain">uwm.edu</email>
              <idno type="idhal" notation="numeric">978255</idno>
              <idno type="halauthorid" notation="string">673855-978255</idno>
              <affiliation ref="#struct-303532"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Hal</forename>
                <surname>Ifip</surname>
              </persName>
              <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2016-07-21 11:18:35</date>
              <date type="whenModified">2024-12-09 16:28:02</date>
              <date type="whenReleased">2016-07-21 11:48:15</date>
              <date type="whenProduced">2011-09-12</date>
              <date type="whenEndEmbargoed">2016-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-01347538v1/document">
                <date notBefore="2016-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01347538v1/file/978-3-642-36062-6_20_Chapter.pdf" id="file-1347538-1427962">
                <date notBefore="2016-01-01"/>
              </ref>
              <ref type="externalLink" target="https://link.springer.com/content/pdf/10.1007%2F978-3-642-36062-6_20.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="200187">
                <persName>
                  <forename>Hal</forename>
                  <surname>Ifip</surname>
                </persName>
                <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01347538</idno>
            <idno type="halUri">https://inria.hal.science/hal-01347538</idno>
            <idno type="halBibtex">stockbridge:hal-01347538</idno>
            <idno type="halRefHtml">&lt;i&gt;25th System Modeling and Optimization (CSMO)&lt;/i&gt;, Sep 2011, Berlin, Germany. pp.197-206, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-642-36062-6_20"&gt;&amp;#x27E8;10.1007/978-3-642-36062-6_20&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">25th System Modeling and Optimization (CSMO), Sep 2011, Berlin, Germany. pp.197-206, &amp;#x27E8;10.1007/978-3-642-36062-6_20&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1347538-1427962"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="IFIP">IFIP - International Federation for Information Processing</idno>
            <idno type="stamp" n="IFIP-AICT" corresp="IFIP">IFIP Advances in Information and Communication Technology</idno>
            <idno type="stamp" n="IFIP-TC" corresp="IFIP">IFIP Technical Committees </idno>
            <idno type="stamp" n="IFIP-TC7" corresp="IFIP-TC">TC 7: System Modeling and Optimization</idno>
            <idno type="stamp" n="IFIP-CSMO" corresp="IFIP">CSMO: Conference on System Modelling and Optimization</idno>
            <idno type="stamp" n="IFIP-AICT-391" corresp="IFIP-AICT">System Modeling and Optimization</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Part 3: Stochastic Optimization and Control</note>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Harvesting in Stochastic Environments: Optimal Policies in a Relaxed Model</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Richard</forename>
                    <forename type="middle">H.</forename>
                    <surname>Stockbridge</surname>
                  </persName>
                  <email type="md5">18f170d2098b85087efeb59905b0a4d2</email>
                  <email type="domain">uwm.edu</email>
                  <idno type="idhal" notation="numeric">978254</idno>
                  <idno type="halauthorid" notation="string">1007451-978254</idno>
                  <affiliation ref="#struct-303532"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Chao</forename>
                    <surname>Zhu</surname>
                  </persName>
                  <email type="md5">311ac496b54c238126519dfabfa1b024</email>
                  <email type="domain">uwm.edu</email>
                  <idno type="idhal" notation="numeric">978255</idno>
                  <idno type="halauthorid" notation="string">673855-978255</idno>
                  <affiliation ref="#struct-303532"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">IFIP Advances in Information and Communication Technology</title>
                <meeting>
                  <title>25th System Modeling and Optimization (CSMO)</title>
                  <date type="start">2011-09-12</date>
                  <date type="end">2011-09-16</date>
                  <settlement>Berlin</settlement>
                  <country key="DE">Germany</country>
                </meeting>
                <editor>Dietmar Hömberg</editor>
                <editor>Fredi Tröltzsch</editor>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">System Modeling and Optimization</biblScope>
                  <biblScope unit="volume">AICT-391</biblScope>
                  <biblScope unit="pp">197-206</biblScope>
                  <date type="datePub">2013</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-642-36062-6_20</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">relaxed control</term>
                <term xml:lang="en">linear programming</term>
                <term xml:lang="en">Singular stochastic control</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>This paper examines the objective of optimally harvesting a single species in a stochastic environment. This problem has previously been analyzed in [1] using dynamic programming techniques and, due to the natural payoff structure of the price rate function (the price decreases as the population increases), no optimal harvesting policy exists. This paper establishes a relaxed formulation of the harvesting model in such a manner that existence of an optimal relaxed harvesting policy can not only be proven but also identified. The analysis imbeds the harvesting problem in an infinite-dimensional linear program over a space of occupation measures in which the initial position enters as a parameter and then analyzes an auxiliary problem having fewer constraints. In this manner upper bounds are determined for the optimal value (with the given initial position); these bounds depend on the relation of the initial population size to a specific target size. The more interesting case occurs when the initial population exceeds this target size; a new argument is required to obtain a sharp upper bound. Though the initial population size only enters as a parameter, the value is determined in a closed-form functional expression of this parameter.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 7</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-303532" status="VALID">
          <idno type="ROR">https://ror.org/031q21x57</idno>
          <orgName>University of Wisconsin–Milwaukee</orgName>
          <date type="start">2016-07-29</date>
          <desc>
            <address>
              <addrLine>P.O. Box 413, Milwaukee, WI 53201</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">http://uwm.edu</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>