<?xml version="1.0"?><rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:edm="http://www.europeana.eu/schemas/edm/" xmlns:wgs84_pos="http://www.w3.org/2003/01/geo/wgs84_pos" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:rdaGr2="http://rdvocab.info/ElementsGr2" xmlns:oai="http://www.openarchives.org/OAI/2.0/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:ore="http://www.openarchives.org/ore/terms/" xmlns:skos="http://www.w3.org/2004/02/skos/core#" xmlns:dcterms="http://purl.org/dc/terms/"><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-JRSLUYBL/c4be34f1-85f7-4e9a-a264-ff1d8acaee94/PDF"><dcterms:extent>396 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-JRSLUYBL/29850cbe-fa07-4b41-a9ee-e28a0b74a563/TEXT"><dcterms:extent>0 KB</dcterms:extent></edm:WebResource><edm:TimeSpan rdf:about="1977-2026"><edm:begin xml:lang="en">1977</edm:begin><edm:end xml:lang="en">2026</edm:end></edm:TimeSpan><edm:ProvidedCHO rdf:about="URN:NBN:SI:doc-JRSLUYBL"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-EE5UIE2V" /><dcterms:issued>1988</dcterms:issued><dc:creator>Barle, Janez</dc:creator><dc:creator>Grad, Janez</dc:creator><dc:format xml:lang="sl">letnik:12</dc:format><dc:format xml:lang="sl">številka:4</dc:format><dc:format xml:lang="sl">str. 39-43</dc:format><dc:identifier>ISSN:0350-5596</dc:identifier><dc:identifier>COBISSID_HOST:5115993</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-JRSLUYBL</dc:identifier><dc:language>en</dc:language><dc:publisher xml:lang="sl">Slovene Society Informatika</dc:publisher><dcterms:isPartOf xml:lang="sl">Informatica (Ljubljana)</dcterms:isPartOf><dc:subject xml:lang="sl">Bellmanov princip optimalnosti</dc:subject><dc:subject xml:lang="en">Bellman's principle</dc:subject><dc:subject xml:lang="en">computer program</dc:subject><dc:subject xml:lang="sl">dinamično programiranje</dc:subject><dc:subject xml:lang="en">discrete dynamic programming</dc:subject><dc:subject xml:lang="sl">diskretno dinamično programiranje</dc:subject><dc:subject xml:lang="en">dynamic programming</dc:subject><dc:subject xml:lang="en">forest exploitation program</dc:subject><dc:subject xml:lang="sl">FORTRAN</dc:subject><dc:subject xml:lang="sl">matematika</dc:subject><dc:subject xml:lang="en">mathematics</dc:subject><dc:subject xml:lang="sl">operacijsko raziskovanje</dc:subject><dc:subject xml:lang="en">operations research</dc:subject><dc:subject xml:lang="sl">program vodenja gozdov</dc:subject><dc:subject xml:lang="sl">računalniški program</dc:subject><dc:subject xml:lang="sl">rastna funkcija</dc:subject><dc:subject xml:lang="en">tree-growing function</dc:subject><dcterms:temporal rdf:resource="1977-2026" /><dc:title xml:lang="sl">Computer program for determining an optimum solution in long-term forest exploitation process|</dc:title><dc:description xml:lang="sl">One can define the long-term forest exploitation process in different ways. Methods of operations research can be used succesfully for this purpose. A group of experts at the University of Ljubljana developed a specific tree-growing function and, based on that, prescribed a set of procedures, relations and states which could represent mathematical model for optimizing the forest exploitation process. The method was defined as a discrete dynamic programming process, based upon Bellman's principle. In this paper we briefly describe the model and computer program prototype for solving it. They both can easily be extended by introducing more complexity into them. The program was written by FORTRAN and tested on DEC-10 computer</dc:description><dc:description xml:lang="sl">Proces dolgoročnega izkoriščanja gozdov moremo opredeliti na več načinov. Primerne v ta namen so tudi metode operacijskaega raziskovanja. Skupina strokovnjakov Univerze v Ljubljani je za določitev matematičnega modela optimizacije postopka izkoriščanja gozdov razvila posebno rastno funkcijo in na temelju le-te definirala zaporedje potrebnih postopkov, relacij in postulatov. Metoda je bila definirana kot postopek, ki temelji na diskretnem dinamičnem programiranju. V članku zgoščeno opišemo prototip modela in računalniškega programa za njegovo rešitev. Model je možno razširiti z vgraditvijo nadaljnjih zahtev in pogojev. Program je bil napisan v programskem jeziku fortran in je bil testiran na računalniku DEC-10</dc:description><edm:type>TEXT</edm:type><dc:type xml:lang="sl">znanstveno časopisje</dc:type><dc:type xml:lang="en">journals</dc:type><dc:type rdf:resource="http://www.wikidata.org/entity/Q361785" /></edm:ProvidedCHO><ore:Aggregation rdf:about="http://www.dlib.si/?URN=URN:NBN:SI:doc-JRSLUYBL"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-JRSLUYBL" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-JRSLUYBL/c4be34f1-85f7-4e9a-a264-ff1d8acaee94/PDF" /><edm:rights rdf:resource="http://rightsstatements.org/vocab/InC/1.0/" /><edm:provider>Slovenian National E-content Aggregator</edm:provider><edm:intermediateProvider xml:lang="en">National and University Library of Slovenia</edm:intermediateProvider><edm:dataProvider xml:lang="sl">Slovensko društvo Informatika</edm:dataProvider><edm:object rdf:resource="http://www.dlib.si/streamdb/URN:NBN:SI:doc-JRSLUYBL/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-JRSLUYBL" /></ore:Aggregation></rdf:RDF>