
<ns0:uwmetadata xmlns:ns0="http://phaidra.univie.ac.at/XML/metadata/V1.0" xmlns:ns1="http://phaidra.univie.ac.at/XML/metadata/lom/V1.0" xmlns:ns10="http://phaidra.univie.ac.at/XML/metadata/provenience/V1.0" xmlns:ns11="http://phaidra.univie.ac.at/XML/metadata/provenience/V1.0/entity" xmlns:ns12="http://phaidra.univie.ac.at/XML/metadata/digitalbook/V1.0" xmlns:ns13="http://phaidra.univie.ac.at/XML/metadata/etheses/V1.0" xmlns:ns2="http://phaidra.univie.ac.at/XML/metadata/extended/V1.0" xmlns:ns3="http://phaidra.univie.ac.at/XML/metadata/lom/V1.0/entity" xmlns:ns4="http://phaidra.univie.ac.at/XML/metadata/lom/V1.0/requirement" xmlns:ns5="http://phaidra.univie.ac.at/XML/metadata/lom/V1.0/educational" xmlns:ns6="http://phaidra.univie.ac.at/XML/metadata/lom/V1.0/annotation" xmlns:ns7="http://phaidra.univie.ac.at/XML/metadata/lom/V1.0/classification" xmlns:ns8="http://phaidra.univie.ac.at/XML/metadata/lom/V1.0/organization" xmlns:ns9="http://phaidra.univie.ac.at/XML/metadata/histkult/V1.0">
  <ns1:general>
    <ns1:identifier>o:32306</ns1:identifier>
    <ns1:title language="en">A note on the heavy longest reach cantilever: An unconventional optimization problem</ns1:title>
    <ns1:language>en</ns1:language>
    <ns1:description language="en">Abstract: We analyze the problem of finding the shape of a heavy cantilever that minimizes volume and satisfies certain condition at the free end that corresponds to the so-called longest reach problem. The Pontryagin’s maximum principle with cross-sectional area as “control” is used in the optimization procedure. We point out some specific properties of the problem. Namely, in one formulation we are faced with standard optimization problem and in another case with unconventional optimization problem.</ns1:description>
    <ns1:keyword language="en">Keywords: Longest Reach Problem, Pontryagin’s Principle, Optimal Shape, Unconventional Extremal</ns1:keyword>
    <ns2:identifiers>
      <ns2:resource>1552099</ns2:resource>
      <ns2:identifier>10.30546/1683-6154.22.4.2023.466</ns2:identifier>
    </ns2:identifiers>
    <ns2:identifiers>
      <ns2:resource>1552101</ns2:resource>
      <ns2:identifier>1683-3511</ns2:identifier>
    </ns2:identifiers>
  </ns1:general>
  <ns1:lifecycle>
    <ns1:upload_date>2024-01-12T10:37:51.803Z</ns1:upload_date>
    <ns1:status>44</ns1:status>
    <ns2:peer_reviewed>no</ns2:peer_reviewed>
    <ns1:contribute seq="0">
      <ns1:role>46</ns1:role>
      <ns1:entity seq="0">
        <ns3:firstname>Ćemal </ns3:firstname>
        <ns3:lastname>Dolićanin</ns3:lastname>
        <ns3:institution>Državni univerzitet u Novom Pazaru</ns3:institution>
        <ns3:conor>2238055</ns3:conor>
        <ns3:orcid>0000-0003-4830-1454</ns3:orcid>
      </ns1:entity>
      <ns1:entity seq="1">
        <ns3:firstname>Enes </ns3:firstname>
        <ns3:lastname>Kačapor</ns3:lastname>
        <ns3:institution>Državni univerzitet u Novom Pazaru</ns3:institution>
        <ns3:type>person</ns3:type>
        <ns3:conor>53071113</ns3:conor>
        <ns3:orcid>0000-0001-6658-051X</ns3:orcid>
      </ns1:entity>
      <ns1:entity seq="2">
        <ns3:firstname>Teodor  </ns3:firstname>
        <ns3:lastname>Atanacković</ns3:lastname>
        <ns3:type>person</ns3:type>
        <ns3:conor>12980071</ns3:conor>
        <ns3:orcid>0000-0002-8714-1388</ns3:orcid>
      </ns1:entity>
    </ns1:contribute>
  </ns1:lifecycle>
  <ns1:technical>
    <ns1:format>application/pdf</ns1:format>
    <ns1:size>1508901</ns1:size>
    <ns1:location>https://phaidrabg.bg.ac.rs/o:32306</ns1:location>
  </ns1:technical>
  <ns1:rights>
    <ns1:cost>no</ns1:cost>
    <ns1:copyright>yes</ns1:copyright>
    <ns1:license>1</ns1:license>
  </ns1:rights>
  <ns1:classification>
    <ns1:purpose>70</ns1:purpose>
  </ns1:classification>
  <ns1:organization>
    <ns8:hoschtyp>92000001</ns8:hoschtyp>
    <ns8:orgassignment>
      <ns8:faculty>20A01</ns8:faculty>
    </ns8:orgassignment>
  </ns1:organization>
  <ns12:digitalbook>
    <ns12:name_magazine language="en">Applied and Computational Mathematics an International Journal</ns12:name_magazine>
    <ns12:volume>22</ns12:volume>
    <ns12:booklet>4</ns12:booklet>
    <ns12:from_page>466</ns12:from_page>
    <ns12:to_page>479</ns12:to_page>
    <ns12:releaseyear>2023</ns12:releaseyear>
  </ns12:digitalbook>
</ns0:uwmetadata>
