<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article">
 <front>
  <journal-meta>
   <journal-id journal-id-type="publisher-id">
    ojf
   </journal-id>
   <journal-title-group>
    <journal-title>
     Open Journal of Forestry
    </journal-title>
   </journal-title-group>
   <issn pub-type="epub">
    2163-0429
   </issn>
   <issn publication-format="print">
    2163-0437
   </issn>
   <publisher>
    <publisher-name>
     Scientific Research Publishing
    </publisher-name>
   </publisher>
  </journal-meta>
  <article-meta>
   <article-id pub-id-type="doi">
    10.4236/ojf.2024.143015
   </article-id>
   <article-id pub-id-type="publisher-id">
    ojf-133979
   </article-id>
   <article-categories>
    <subj-group subj-group-type="heading">
     <subject>
      Articles
     </subject>
    </subj-group>
    <subj-group subj-group-type="Discipline-v2">
     <subject>
      Earth 
     </subject>
     <subject>
       Environmental Sciences
     </subject>
    </subj-group>
   </article-categories>
   <title-group>
    From Finnish Assortment Pricing to Market Economy Using Prices for Sawn Wood and Chips in Reference Bucking
   </title-group>
   <contrib-group>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Juha
      </surname>
      <given-names>
       Lappi
      </given-names>
     </name>
    </contrib>
   </contrib-group> 
   <aff id="affnull">
    <addr-line>
     aFaculty of Environmental Sciences and Natural Resource Management, Norwegian University of Life Sciences, Ås, Norway
    </addr-line> 
   </aff> 
   <pub-date pub-type="epub">
    <day>
     22
    </day> 
    <month>
     05
    </month>
    <year>
     2024
    </year>
   </pub-date> 
   <volume>
    14
   </volume> 
   <issue>
    03
   </issue>
   <fpage>
    233
   </fpage>
   <lpage>
    280
   </lpage>
   <history>
    <date date-type="received">
     <day>
      14,
     </day>
     <month>
      May
     </month>
     <year>
      2024
     </year>
    </date>
    <date date-type="published">
     <day>
      21,
     </day>
     <month>
      May
     </month>
     <year>
      2024
     </year> 
    </date> 
    <date date-type="accepted">
     <day>
      21,
     </day>
     <month>
      June
     </month>
     <year>
      2024
     </year> 
    </date>
   </history>
   <permissions>
    <copyright-statement>
     © Copyright 2014 by authors and Scientific Research Publishing Inc. 
    </copyright-statement>
    <copyright-year>
     2014
    </copyright-year>
    <license>
     <license-p>
      This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/
     </license-p>
    </license>
   </permissions>
   <abstract>
    Dominant Finnish assortment pricing gives prices for sawlog and pulp wood volumes. Buyers buck stems to sawlogs using secret price matrices. Agreed dimensions allow wide range of sawlog volumes. Forest owners cannot objectively compare biddings: timber trade is a lottery game. Bucking is analyzed in terms of sawlog, pulp wood, log cylinder, sawn wood, value-weighted sawn wood, and chips. Sawn wood and its value are computed from top diameter of the sawlog. Profit maximization requires buyers to buck logs producing smaller than maximal value, causing dead weight loss. Nominal assortment prices have unpredictable relation to effective stumpage price. Assortment pricing does not meet requirements of market economy. If sawmills linked to pulp mills buck smaller sawlog percentages than independent sawmills, as generally believed, they use higher price for chips in their own harvests than they pay for independent sawmills, indicating imperfect competition for chips. Sawn wood potential pricing is suggested which gives prices for sawn wood and chips coming both from sawlogs and pulp wood in reference bucking which maximizes sawn wood for given minimum and maximum log length and minimum top diameter. Simple algorithm generates feasible bucking schedules from which optimum can be selected using any objective. Pricing produces unit price for all commercial wood utilizing ratio of theoretical sawn wood and commercial volume in stand. Unit price can be compared to stem pricing and could be compared to assortment pricing if assortment pricing would produce predictable sawlog percentages. Sawn wood potential pricing is concrete, transparent, easy to compute, considers stem size and tapering, reduces trading cost and is less risky to buyers than stem pricing. It meets requirements of market economy. Readers can repeat computations using open-source software Jlp22.
   </abstract>
   <kwd-group> 
    <kwd>
     Sawmill
    </kwd> 
    <kwd>
      Pulp Mill
    </kwd> 
    <kwd>
      Jlp22
    </kwd> 
    <kwd>
      Dead Weight Loss
    </kwd> 
    <kwd>
      Stem Price
    </kwd>
   </kwd-group>
  </article-meta>
 </front>
 <body>
  <sec id="s1">
   <title>1. Introduction</title>
   <p>Harvesting technology <xref ref-type="bibr" rid="scirp.133979-21">
     (Uusitalo, 2010)
    </xref> and sawmill technology <xref ref-type="bibr" rid="scirp.133979-22">
     (Varis, 2018)
    </xref> set the framework where the timber trade and optimization of bucking and sawing operate. Timber trade uses timber prices to get timber from forest to sawmills and pulp mills. A good analysis and overview of different pricing methods in Finland is given in Finnish by <xref ref-type="bibr" rid="scirp.133979-4">
     Hekkala (2023)
    </xref>. His thesis and references in it (e.g. <xref ref-type="bibr" rid="scirp.133979-13">
     Malinen &amp; Palander, 2004;
    </xref> <xref ref-type="bibr" rid="scirp.133979-15">
     Malinen et al., 2010;
    </xref> <xref ref-type="bibr" rid="scirp.133979-14">
     Malinen et al., 2015
    </xref>) describe the properties and problems in different pricing methods. I analyze quantitatively well-known properties of the assortment pricing and suggest a new pricing method.</p>
   <sec id="s1_1">
    <title>1.1. Assortment Pricing</title>
    <p>In market economy, prices have two duties:</p>
    <p>1) Prices help sellers to find the best buyer and buyers to find best sellers in current deals.</p>
    <p>2) Prices transmit information between supply and demand so that sellers and buyers can optimize their future operations.</p>
    <p>In the dominant Finnish assortment pricing, a buyer pays different price for sawlog and pulp wood volumes measured from the logs cut by a harvester. Different buyers buck stems into different dimensions and agreed dimensions of each buyer allow a wide range of sawlog volumes. The bucking algorithm in the harvester uses a secret price matrix given by the buyer. The effective stumpage price is secret when the deal is made, and it has unpredictable relation to the nominal sawlog and pulp prices. In the assortment pricing, forest owners cannot objectively compare different biddings before or after the deal even if the owner would know each stem in the stand precisely.</p>
    <p>In assortment pricing, the relation between the effective stumpage price and the nominal sawlog and pulp wood prices is weird. Prices do not properly transmit information between supply and demand. Time horizon is long both in building sawmills and pulp mills and in growing and harvesting forests. Assortment pricing does not support long term development of forestry and forest industries. I try to shed light on viewpoints which have kept the assortment pricing alive decades after the harvesters made it obsolete from the viewpoint of market economy.</p>
    <p>In standard trade, the seller gets the total price computed by multiplying unit price with the number of units. The unit price is agreed. The number of units can be measured from the commodity at time when the buyer gets the control of it. It may be possible that the measurements are done after the deal. In standard trade, the seller cannot influence, and has no reason to influence, the handling of the commodity after the buyer gets control of it. In the assortment pricing, buyers decide sawlog and pulp wood proportions after the deal. They can influence only slightly the total commercial volume. There are strict regulations how stem diameters and volumes are measured, and measurements calibrated but no legal rules for the bucking.</p>
    <p>When buyers buck stems, profit maximization requires them to maximize the difference between the total value of the obtained logs (sawlogs and pulp logs) and the stumpage price. If the stumpage price does not depend on the actual bucking, in ‘free bucking’, profit maximization requires buyers to buck as valuable logs as possible. If the stumpage price depends on the actual bucking, the profit is maximized with logs having smaller value than obtained in free bucking. Such inefficiencies are typical when rules of market economy are not followed. They are called deadweight loss (economic inefficiency, allocative inefficiency, excess burden, or 31 other synonyms).</p>
    <p>Some forest owners, surprised of the small sawlog volumes, have accused buyers of transporting ‘valuable sawlog part’ to pulp mills. Some journalists and spokesmen of forest owners have supported them. However, there is no ‘valuable sawlog part’ in a standing tree. A sawlog is valuable only if the sawmill can make valuable goods of it. From buyer’s point of view, the ‘valuable sawlog transported to pulp mill’ confuses ‘valuable’ and ‘expensive’. Potential sawlog volume transported to a sawmill is always expensive, but it may, or may not be valuable.</p>
    <p>In market economy, there is no fair price, just a market price. A forest owner has an objective reason to be dissatisfied after seeing the obtained sawlog percentage, if the owner thinks that another buyer offering seemingly lower nominal prices had bucked a higher effective stumpage price. In the assortment pricing it is not possible to know, even after the harvest, whether the best buyer was selected. The pricing system in which forest owners cannot objectively compare biddings is to be blamed, not a particular buyer taking advantage of the loopholes of the system. Law requires joint-stock companies to make profit to the shareholders. Thus, law requires companies to mislead forest owners in the assortment pricing whenever it is profitable.</p>
    <p>The discussion of assortment pricing has concentrated on the sawlog volume. The assortment pricing implies a permanent conflict of interest between the forest owner and the buyer. The forest owner wants to get large sawlog volume. The buyer is interested to get valuable products with minimal stumpage price. At potential cutting lengths, the volume and value of sawn wood are almost independent of the sawlog volume. The bucking cannot be understood without analyzing relation between sawlog volume, sawn wood volume and value of sawn wood. This paper provides such an analysis. A key concept is the log cylinder. If log length increases, the log volume and the length of the log cylinder increase but the diameter of the log cylinder decreases leading to either increasing, constant or decreasing volume of log cylinder. The interaction of log length, top diameter and log cylinder volume sets up the framework for the optimization of the bucking and for the inevitable conflict between the forest owner and the buyer in the assortment pricing. The top diameter of a log determines further the relation between the volume of log cylinder and the volume and value of sawn wood.</p>
    <p>The part of sawlog which does not go into sawn wood, produces chips and bark. It is comparable to the pulp wood which produces directly chips and bark. The analysis leads to a suggestion of a pricing method, sawn wood potential pricing, where the price is based on the theoretical amount of the sawn wood and chips which come both from sawlogs and pulp logs in a reference bucking. In this pricing, a forest owner can objectively compare biddings, and the price considers the buyer’s interest in the sawn wood and chips and thus sends information to the supply as prices do in market economy.</p>
    <p>In stem pricing, one price is given for all commercial wood. A forest owner can compare different biddings in the current deal, but stem pricing does not give information to the supply-side where and when to make next harvest. Both in assortment pricing and stem pricing, commercial wood is defined to be up to given minimum diameter. Tops are often cut at a larger diameter. In the suggested sawn wood potential pricing, price is also given up to the agreed top diameter. If the last cut is done earlier, the volume of potential pulp wood can be predicted using simple equations presented. In the sawn wood potential pricing, reference bucking of sawlogs is done for healthy and undamaged parts of stems. Detection of damaged parts is the only way how the pricing depends on the realized bucking.</p>
    <p>Buyers of timber are here classified into independent sawmills and into sawmills which are part of companies which have both sawmills and pulp mills. The latter are called sawmills with pulp. <xref ref-type="bibr" rid="scirp.133979-5">
      Kallio (2001)
     </xref> showed that competition at the chip market was not perfect due to oligopoly of chip buyers, companies owning pulp mills. If there are only few possible buyers within a reasonable distance, buyers have strong pricing power.</p>
    <p>This paper gives indirect evidence that competition at the chip market is not yet perfect, even if energy plants buying chips have changed the market. It is a common view that sawmills with pulp buck considerably smaller sawlog percentages than independent sawmills. If sawmills with pulp use the same price for chips in their own harvests as they pay for independent sawmills, they would buck approximately the same sawlog percentages as independent sawmills.</p>
    <p>Many forest owners are convinced that sawmills with pulp tend to buck small sawlog percentages because they want to get more pulp wood which they need in their pulp mills. When the price of chips increases, the main reason for bucking more pulp wood is initially to transfer chips from the expensive sawlogs into cheap pulpwood with small sacrifice in sawn wood and consequently with small increase of total volume of chips. The total amount of chips starts to increase considerably with very high chip prices.</p>
   </sec>
   <sec id="s1_2">
    <title>1.2. Objectives of the Paper</title>
    <p>The paper has six objectives:</p>
    <p>1) To analyze the relations of amount of sawn wood, value of sawn wood, sawlog volume and volumes of chips coming both from sawlogs and pulp wood and their implications to the bucking optimization and pricing.</p>
    <p>2) To demonstrate that in the assortment pricing the forest owners cannot compare objectively biddings as different buyers use different dimensions for sawlogs and the agreed dimensions allow a wide range of sawlog volumes.</p>
    <p>3) To demonstrate how profit maximization requires buyers to buck less valuable logs in the assortment pricing than in free bucking, leading to deadweight losses.</p>
    <p>4) To suggest sawn wood potential pricing, based on the analyses of the stem components. The pricing is concrete, easy to compute, transparent, incorporates the positive effect of tree size and small tapering, reduces trading cost, is less risky both to the forest owners and buyers and allows forest owners to compare biddings objectively, allows the accumulation of knowledge and standard market economy relations between price, supply and demand. It is shown how transition to this pricing can be done smoothly.</p>
    <p>5) To estimate models for predicting the volume of the treetops which the harvester has not measured, but which is within the agreed pulp wood.</p>
    <p>6) To make critical comments on distribution bucking and on the forestry tradition to hide information from forest owners and from researchers. I also suggest new research on optimization of bucking and saw blade settings.</p>
    <p>The paper is not a standard research article: it is long with many components. Before the epoch of twitter publishing, the study had been a monograph. I want to keep it as single article as making several papers would cause overlapping components and it would cause extra trouble for readers to put parts spread to several papers together. The paper contains technical material which is not essential for understanding the main ideas. Readers wanting to continue the work or to apply the sawn wood potential pricing need those details. To allow selective reading, many chapters and sections start with a summary.</p>
    <p>The key points of this paper are not scientific results. That forest owners cannot compare objectively biddings in the assortment pricing and that stem pricing does not give information for the optimization of future management, are just well-known build-in properties of the pricing methods. My pricing suggestion is not a scientific result. If an engineer designs a new ax, the ax does not need the approval of peer engineers, only acceptance of a manufacturer and clients. Assortment pricing and stem pricing have not been accepted by ‘peer reviewers’, either.</p>
    <p>Different partners of timber trade can get different benefits from potential pricing methods. There is no scientific, value-free method to compare the benefits. Science does not tell that benefits of buyers getting deals with small effective stumpage price using misleading biddings or of forest owner associations in the bucking foreseeing business are less important than benefits produced by market economy.</p>
    <p>The analysis of the relations of stem components and bucking optimization is standard research. It may be of interest for readers not interested in the peculiar features of Finnish timber trade. All the computations can be repeated using the open-source software Jlp22 and a script file stem.inc in folder stem at <xref ref-type="bibr" rid="scirp.133979-https://github.com/juhalappi/jlp22">
      https://github.com/juhalappi/jlp22
     </xref>. I call readers to make a critical evaluation of my results. Critical scientists never rely on other peer reviewers than themselves.</p>
   </sec>
   <sec id="s1_3">
    <title>1.3. Symbol Tables</title>
    <p>Harvesters measure with-bark diameters. Thus, the bucking and pricing need to be based on with-bark diameters. Sawmills saw under-bark sawlogs. So, for sawmills under-bark diameters are essential. This paper is focusing on bucking and pricing. Thus, the analysis is based on with-bark diameters. Under-bark diameters need to be considered when converting with-bark volumes to the volumes and values of sawn wood.</p>
    <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
     <tr> 
      <td class="custom-bottom-td acenter" width="100.00%" colspan="2"><p style="text-align:center">Bucking parameters</p></td> 
     </tr> 
     <tr> 
      <td class="custom-top-td acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             L 
           </mi> 
           <mrow> 
            <mi>
              min 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="custom-top-td aleft" width="83.42%"><p style="text-align:left">Minimum length of sawlog, default 40 dm.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             L 
           </mi> 
           <mrow> 
            <mi>
              max 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">Maximum sawlog length, default 55 dm.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mrow> 
            <mi>
              min 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">Minimum top diameter, default 15 cm.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mrow> 
            <mi>
              min 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">Minimum diameter of pulp wood, default 5 cm.</p></td> 
     </tr> 
    </table>
    <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
     <tr> 
      <td class="custom-bottom-td acenter" width="100.00%" colspan="2"><p style="text-align:center">Variables describing logs (upper case for with-bark variables)</p></td> 
     </tr> 
     <tr> 
      <td class="custom-top-td acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="custom-top-td aleft" width="83.42%"><p style="text-align:left">Top diameter of sawlog under-bark.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">Top diameter of sawlog with bark.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <mi>
            f 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               d 
             </mi> 
             <mrow> 
              <mi>
                t 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                p 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">Proportion of under-bark cross-sectional area of sawlog top or log cylinder going to sawn wood.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <mi>
            u 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               u 
             </mi> 
             <mrow> 
              <mi>
                t 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                p 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">Relative value of sawn wood coming from under-bark log with given 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math>.</p></td> 
     </tr> 
    </table>
    <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
     <tr> 
      <td class="custom-bottom-td acenter" width="100.00%" colspan="2"><p style="text-align:center">Variables for stems</p></td> 
     </tr> 
     <tr> 
      <td class="custom-top-td acenter" width="16.58%"><p style="text-align:center">dbh</p></td> 
      <td class="custom-top-td aleft" width="83.42%"><p style="text-align:left">Diameter at breast height, 13 dm, measured from the stump.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mi>
             m 
           </mi> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">Last diameter the harvester has measured.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <mi>
            D 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             L 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">With-bark diameter at length L. When 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <mi>
            L 
          </mi> 
          <mo>
            ≤ 
          </mo> 
          <mn>
            13 
          </mn> 
          <mtext>
              
          </mtext> 
          <mtext>
            dm 
          </mtext> 
         </mrow> 
        </math>, harvesters get 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <mi>
            D 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             L 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
        </math> from official base function, here it comes from the data. Harvesters store 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <mi>
            D 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             L 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
        </math> at one dm steps into stem vectors.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <mi>
            L 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             D 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">Length of the stem to point where diameter is D.</p></td> 
     </tr> 
    </table>
    <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
     <tr> 
      <td class="custom-bottom-td custom-top-td acenter" width="100.00%" colspan="2"><p style="text-align:center">Volume components at log, stem or stand level (upper case subindex for bark)</p></td> 
     </tr> 
     <tr> 
      <td class="custom-top-td acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              m 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="custom-top-td aleft" width="83.42%"><p style="text-align:left">With-bark volume of commercial stem up to 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mrow> 
            <mi>
              min 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math>.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              l 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              g 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">With-bark volume of sawlog(s).</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              p 
            </mi> 
            <mi>
              u 
            </mi> 
            <mi>
              l 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">Volume of pulp wood, 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              m 
            </mi> 
           </mrow> 
          </msub> 
          <mo>
            − 
          </mo> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              l 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              g 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math>.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              C 
            </mi> 
            <mi>
              Y 
            </mi> 
            <mi>
              L 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">Volume of with-bark log cylinder whose top is the cross sectional area containing bark, i.e., 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <mn>
            0.25 
          </mn> 
          <mi>
            π 
          </mi> 
          <msubsup> 
           <mi>
             D 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
           <mn>
             2 
           </mn> 
          </msubsup> 
          <mi>
            L 
          </mi> 
         </mrow> 
        </math> for one log with length L.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              y 
            </mi> 
            <mi>
              l 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">Volume of under-bark log cylinder(s), 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <mn>
            0.25 
          </mn> 
          <mi>
            π 
          </mi> 
          <msubsup> 
           <mi>
             d 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
           <mn>
             2 
           </mn> 
          </msubsup> 
          <mi>
            L 
          </mi> 
         </mrow> 
        </math> for one log with length L.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">Volume of sawn wood, including saw dust. For a log it is initially a function of log length L and under-bark top diameter 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math>. Using a correction coefficient, it can be computed from 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math>.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
            <mi>
              u 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">Value-weighted amount of the sawn wood where weights are proportional to the price of the sawn wood and scaled so that the total amount of 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math> and 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
            <mi>
              u 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math> are equal when 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
            <mi>
              u 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math> is maximized in the used data.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              I 
            </mi> 
            <mi>
              N 
            </mi> 
            <mi>
              C 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">Volume of in-chips, i.e., chips within the with-bark log cylinder, 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              C 
            </mi> 
            <mi>
              Y 
            </mi> 
            <mi>
              L 
            </mi> 
           </mrow> 
          </msub> 
          <mo>
            − 
          </mo> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math>.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              O 
            </mi> 
            <mi>
              U 
            </mi> 
            <mi>
              T 
            </mi> 
            <mi>
              C 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">Out-chips between with-bark log-cylinder and the surface of the stem, including thus bark, 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              l 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              g 
            </mi> 
           </mrow> 
          </msub> 
          <mo>
            − 
          </mo> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              C 
            </mi> 
            <mi>
              Y 
            </mi> 
            <mi>
              L 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math>.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              h 
            </mi> 
            <mi>
              i 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">Volume of chips from sawlogs, 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              I 
            </mi> 
            <mi>
              N 
            </mi> 
            <mi>
              C 
            </mi> 
           </mrow> 
          </msub> 
          <mo>
            + 
          </mo> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              O 
            </mi> 
            <mi>
              U 
            </mi> 
            <mi>
              T 
            </mi> 
            <mi>
              C 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math>. It can be computed equivalently from under-bark variables.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              t 
            </mi> 
            <mi>
              c 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">Total volume of chips both from sawlogs and pulp wood, 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              h 
            </mi> 
            <mi>
              i 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
          <mo>
            + 
          </mo> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              p 
            </mi> 
            <mi>
              u 
            </mi> 
            <mi>
              l 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
          <mo>
            = 
          </mo> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              m 
            </mi> 
           </mrow> 
          </msub> 
          <mo>
            − 
          </mo> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math>.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <mi>
            V 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               D 
             </mi> 
             <mn>
               1 
             </mn> 
            </msub> 
            <mo>
              , 
            </mo> 
            <msub> 
             <mi>
               D 
             </mi> 
             <mn>
               2 
             </mn> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">With bark volume between diameters D<sub>1</sub> and D<sub>2</sub>.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <mi>
            V 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               L 
             </mi> 
             <mn>
               1 
             </mn> 
            </msub> 
            <mo>
              , 
            </mo> 
            <msub> 
             <mi>
               L 
             </mi> 
             <mn>
               2 
             </mn> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">With bark volume between lengths L<sub>1</sub> and L<sub>2</sub>. In principle, but not in practice, this and the previous definition can lead to confusion.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msubsup> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
           <mrow> 
            <mi>
              max 
            </mi> 
           </mrow> 
          </msubsup> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">The maximum volume of sawn wood among all bucking schedules satisfying the bucking parameters, the sawn wood potential.</p></td> 
     </tr> 
    </table>
    <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
     <tr> 
      <td class="custom-bottom-td acenter" width="100.00%" colspan="2"><p style="text-align:center">Prices the forest owner gets (note lower case)</p></td> 
     </tr> 
     <tr> 
      <td class="custom-top-td acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mrow> 
            <mi>
              l 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              g 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="custom-top-td aleft" width="83.42%"><p style="text-align:left">Unit price of sawlog volume in the assortment pricing.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mrow> 
            <mi>
              p 
            </mi> 
            <mi>
              u 
            </mi> 
            <mi>
              l 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">Unit price of the pulp wood volume in the assortment pricing.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              t 
            </mi> 
            <mi>
              u 
            </mi> 
            <mi>
              m 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">Total stumpage price in the assortment pricing.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">Unit price of sawn wood potential 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msubsup> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
           <mrow> 
            <mi>
              max 
            </mi> 
           </mrow> 
          </msubsup> 
         </mrow> 
        </math> in the sawn wood potential pricing.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              h 
            </mi> 
            <mi>
              i 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">Unit price of total amount of chips 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              m 
            </mi> 
           </mrow> 
          </msub> 
          <mo>
            − 
          </mo> 
          <msubsup> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
           <mrow> 
            <mi>
              max 
            </mi> 
           </mrow> 
          </msubsup> 
         </mrow> 
        </math> in the sawn wood potential pricing.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mrow> 
            <mi>
              p 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              t 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">Total stumpage price in the sawn wood potential pricing.</p></td> 
     </tr> 
    </table>
    <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
     <tr> 
      <td class="custom-bottom-td custom-top-td acenter" width="100.00%" colspan="2"><p style="text-align:center">Prices or values the buyers get (note upper case)</p></td> 
     </tr> 
     <tr> 
      <td class="custom-top-td acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             P 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="custom-top-td aleft" width="83.42%"><p style="text-align:left">The net unit price of 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
            <mi>
              u 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math> when variable production costs are subtracted from the sales price.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             P 
           </mi> 
           <mrow> 
            <mi>
              p 
            </mi> 
            <mi>
              u 
            </mi> 
            <mi>
              l 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">The unit price of pulp wood when an independent sawmill sells pulp wood to a pulp mill or energy plant.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="16.58%"><p style="text-align:center"> 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             P 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              h 
            </mi> 
            <mi>
              i 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
      <td class="aleft" width="83.42%"><p style="text-align:left">The price of chips an independent sawmill gets from chips going to pulp mills or energy plants or the ‘price’ a sawmill with pulp gets when ‘selling’ chips to the company owning both the sawmill and pulp mills, a control parameter in bucking.</p></td> 
     </tr> 
    </table>
    <p>Log lengths of sawlogs are assumed to step in 3 dm steps. If not stated otherwise, it is assumed that</p>
    <p>Log lengths are given in decimeters. This is useful as harvesters store diameters at 1 dm steps. Meters would cause rounding errors in computers. Diameters are in centimeters. It is not assumed that the sawmills restrict bucking now or in the future with the above parameters. A formal analysis of the assortment pricing requires that the allowable dimensions are described precisely. The sawn wood potential pricing is based on a reference bucking. The above bucking parameters are used both in the analyses of the assortment pricing and in the sawn wood potential pricing. Ratios like 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mrow> 
         <msub> 
          <mi>
            V 
          </mi> 
          <mrow> 
           <mi>
             s 
           </mi> 
           <mi>
             a 
           </mi> 
           <mi>
             w 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          / 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            V 
          </mi> 
          <mrow> 
           <mi>
             c 
           </mi> 
           <mi>
             o 
           </mi> 
           <mi>
             m 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
       </mrow> 
      </mrow> 
     </math> are called percentages even if they must be multiplied with 100 to make them percentages.</p>
   </sec>
   <sec id="s1_4">
    <title>1.4. Pricing Methods Analyzed</title>
    <p>In the assortment pricing, a forest owner gets price</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          p 
        </mi> 
        <mrow> 
         <mi>
           s 
         </mi> 
         <mi>
           t 
         </mi> 
         <mi>
           u 
         </mi> 
         <mi>
           m 
         </mi> 
         <mi>
           p 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          p 
        </mi> 
        <mrow> 
         <mi>
           l 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           g 
         </mi> 
        </mrow> 
       </msub> 
       <msub> 
        <mi>
          V 
        </mi> 
        <mrow> 
         <mi>
           l 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           g 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         + 
       </mo> 
       <msub> 
        <mi>
          p 
        </mi> 
        <mrow> 
         <mi>
           p 
         </mi> 
         <mi>
           u 
         </mi> 
         <mi>
           l 
         </mi> 
         <mi>
           p 
         </mi> 
        </mrow> 
       </msub> 
       <msub> 
        <mi>
          V 
        </mi> 
        <mrow> 
         <mi>
           p 
         </mi> 
         <mi>
           u 
         </mi> 
         <mi>
           l 
         </mi> 
         <mi>
           p 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> (1)</p>
    <p>where 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          p 
        </mi> 
        <mrow> 
         <mi>
           s 
         </mi> 
         <mi>
           t 
         </mi> 
         <mi>
           u 
         </mi> 
         <mi>
           m 
         </mi> 
         <mi>
           p 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> is the stumpage price, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          V 
        </mi> 
        <mrow> 
         <mi>
           l 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           g 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          V 
        </mi> 
        <mrow> 
         <mi>
           p 
         </mi> 
         <mi>
           u 
         </mi> 
         <mi>
           l 
         </mi> 
         <mi>
           p 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> are the sawlog and pulp wood volumes the buyer bucks using the agreed dimensions and a secret price matrix, and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          p 
        </mi> 
        <mrow> 
         <mi>
           l 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           g 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          p 
        </mi> 
        <mrow> 
         <mi>
           p 
         </mi> 
         <mi>
           u 
         </mi> 
         <mi>
           l 
         </mi> 
         <mi>
           p 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> are their unit prices.</p>
    <p>I suggest that a forest owner gets the sawn wood potential price</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          p 
        </mi> 
        <mrow> 
         <mi>
           p 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           t 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          p 
        </mi> 
        <mrow> 
         <mi>
           s 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           w 
         </mi> 
        </mrow> 
       </msub> 
       <msubsup> 
        <mi>
          V 
        </mi> 
        <mrow> 
         <mi>
           s 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           w 
         </mi> 
        </mrow> 
        <mrow> 
         <mi>
           max 
         </mi> 
        </mrow> 
       </msubsup> 
       <mo>
         + 
       </mo> 
       <msub> 
        <mi>
          p 
        </mi> 
        <mrow> 
         <mi>
           c 
         </mi> 
         <mi>
           h 
         </mi> 
         <mi>
           i 
         </mi> 
         <mi>
           p 
         </mi> 
        </mrow> 
       </msub> 
       <msub> 
        <mi>
          V 
        </mi> 
        <mrow> 
         <mi>
           t 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           t 
         </mi> 
         <mi>
           c 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          p 
        </mi> 
        <mrow> 
         <mi>
           s 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           w 
         </mi> 
        </mrow> 
       </msub> 
       <msubsup> 
        <mi>
          V 
        </mi> 
        <mrow> 
         <mi>
           s 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           w 
         </mi> 
        </mrow> 
        <mrow> 
         <mi>
           max 
         </mi> 
        </mrow> 
       </msubsup> 
       <mo>
         + 
       </mo> 
       <msub> 
        <mi>
          p 
        </mi> 
        <mrow> 
         <mi>
           c 
         </mi> 
         <mi>
           h 
         </mi> 
         <mi>
           i 
         </mi> 
         <mi>
           p 
         </mi> 
        </mrow> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            V 
          </mi> 
          <mrow> 
           <mi>
             c 
           </mi> 
           <mi>
             o 
           </mi> 
           <mi>
             m 
           </mi> 
          </mrow> 
         </msub> 
         <mo>
           − 
         </mo> 
         <msubsup> 
          <mi>
            V 
          </mi> 
          <mrow> 
           <mi>
             s 
           </mi> 
           <mi>
             a 
           </mi> 
           <mi>
             w 
           </mi> 
          </mrow> 
          <mrow> 
           <mi>
             max 
           </mi> 
          </mrow> 
         </msubsup> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> (2)</p>
    <p>where 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          p 
        </mi> 
        <mrow> 
         <mi>
           p 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           t 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> is the total stumpage price in the sawn wood potential pricing, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          V 
        </mi> 
        <mrow> 
         <mi>
           s 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           w 
         </mi> 
        </mrow> 
        <mrow> 
         <mi>
           max 
         </mi> 
        </mrow> 
       </msubsup> 
      </mrow> 
     </math> is the volume of sawn wood maximizing the amount of sawn wood among all bucking schedules satisfying the agreed bucking parameters, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          p 
        </mi> 
        <mrow> 
         <mi>
           s 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           w 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> is its unit price, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          V 
        </mi> 
        <mrow> 
         <mi>
           t 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           t 
         </mi> 
         <mi>
           c 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> is the total amount of chips and bark coming both from sawlogs and the theoretical pulp wood, i.e., 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          V 
        </mi> 
        <mrow> 
         <mi>
           t 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           t 
         </mi> 
         <mi>
           c 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          V 
        </mi> 
        <mrow> 
         <mi>
           c 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           m 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         − 
       </mo> 
       <msub> 
        <mi>
          V 
        </mi> 
        <mrow> 
         <mi>
           s 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           w 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> where 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          V 
        </mi> 
        <mrow> 
         <mi>
           c 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           m 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> is the commercial volume, and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          p 
        </mi> 
        <mrow> 
         <mi>
           c 
         </mi> 
         <mi>
           h 
         </mi> 
         <mi>
           i 
         </mi> 
         <mi>
           p 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> is unit price of 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          V 
        </mi> 
        <mrow> 
         <mi>
           t 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           t 
         </mi> 
         <mi>
           c 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math>. Theoretical bucking is done using healthy parts of stems.</p>
    <p>In stem pricing, a fixed species-dependent unit price is given for all commercial wood the harvester makes. In the size-dependent stem pricing offered by M-Group, the unit price depends on the average commercial volume of trees.</p>
    <sec id="s1">
     <title>2. Data</title>
     <p>Stem curve data of <xref ref-type="bibr" rid="scirp.133979-8">
       Laasasenaho (1982)
      </xref> are used in the analysis. Diameters and bark thicknesses were measured at relative heights of 1, 2.5, 5, 7.5, 10, 15, 20, 30, 40, 50, 60, 70, 80 and 90 percent. Diameters are interpolated linearly with one dm steps from the measured or at least 1 dm stump. The obtained stem vectors are similar as made by harvesters, except they contain also tops and stems are more regular due to the linear interpolation. The data contains trees for Scots pine, Norway spruce and birch. Birch data did not contain bark measurements. Analysis results are presented only for pine. Models for top volumes are estimated also for spruce and birch. Coefficients needed to transfer with-bark diameters into sawn wood volume and its value are computed also for spruce but not for birch. Institute of Natural Resources Finland (Luke) has allowed to put the data into <xref ref-type="bibr" rid="scirp.133979-#inbox/_blank">
       https://github.com/juhalappi/jlp22
      </xref>.</p>
     <p>As the data do not come from harvests, the results computed using Laasasenaho’s data describe only qualitatively the relations between variables. The pricing suggestion uses stem data only for the estimation of the model for pulpwood between last cut and the minimum pulp log diameter 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           d 
         </mi> 
         <mrow> 
          <mi>
            min 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. Saw blade setting data provided by Antti Heikkilä are used to define functions for the volume and value of sawn wood.</p>
    </sec>
   </sec>
   <sec id="s3">
    <title>3. Jlp22 Software</title>
    <p>Jlp22 is the successor of J software which was the successor of JLP software of <xref ref-type="bibr" rid="scirp.133979-10">
      Lappi (1992)
     </xref> which solves efficiently linear programming (LP) problems where a simulator simulates several treatment schedules for each stand and LP problems are formulated in terms of sums over all stands. J contained many tools for mathematical and statistical analysis. J version 2.0 published together with Reetta Lempinen <xref ref-type="bibr" rid="scirp.133979-11">
      (Lappi &amp; Lempinen, 2014)
     </xref> made it possible optimize (somehow) simultaneously forestry and transportations to factories and factory production. Luke decided in 2017, after my retirement, to publish J as open-source software but never published it. It gave me in 2021 permission to publish and develop the software. Thereafter I have completely rewritten and enhanced it. A simpler and more efficient algorithm for the factory optimization is under implementation. The name was changed into Jlp22, because there is J programming language and Jlp22 is completely different than J. Versions are now indicated by the date when they are put into <xref ref-type="bibr" rid="scirp.133979-#inbox/_blank">
      https://github.com/juhalappi/jlp22
     </xref>.</p>
    <p>The most important addition for this study is function stemopt which can be used to compute the optimal bucking for any objective stem after stem, or to write all possible bucking schedules to the disk to be used in linear programming (LP) for the analysis of bucking possibilities for stands to be harvested. The resulting linear programming problems have the same mathematical structure as standard management planning problems for which the LP algorithm of Jlp22 was designed. Linear programming is referred only in the discussion. The optimization is done in stemopt function by generating for each tree all possible bucking schedules satisfying the bucking parameters and selecting the best schedule. A reader can redo all figures and the table using the script file stem.inc and giving command shortcut ‘all’. Individual figures can be produced with shortcuts ‘fig1’ etc., and the table with ‘table1’. Jlp22 uses in the computations also its mathematical, matrix and graphics functions. Graphics utilizes gnuplot.</p>
   </sec>
   <sec id="s4">
    <title>4. Stem Components</title>
    <p>A harvester divides a stem into sawlogs, pulp logs and top. Commercial volume refers here to sawlogs and pulp logs. In practice also tops may have value, at least with subsidies. It is assumed that tops may be sold with a separate deal. A sawmill divides sawlogs into sawn wood products, saw dust, chips, and bark. Saw dust is just a sawn wood product. Bark is here not separated from chips coming from sawlogs or pulp logs. The price (value) of chips is thus weighted average of bark and chip prices. It had been equally logical to put the saw dust into the chip component. A saw blade setting determines how much a log produces sawn products. The sawmill literature describes the blade settings with the ratio of log volume to the volume of sawn products. I suggest that the volume of log cylinder should be used as the reference, not the log volume. This way the joint effect of the blade setting and top diameter can be separated from the effect of the stem tapering and log length.</p>
    <sec id="s4_1">
     <title>4.1. Sawn Wood and Its Value</title>
     <p>The under-bark top diameter of a sawlog 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           d 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> determines what blade settings are feasible. The ratio between the volume of the sawn wood and the volume of the under-bark log cylinder, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mrow> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              y 
            </mi> 
            <mi>
              l 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math> is used here to describe blade settings. Ignoring nuances of the side boards, this ratio is equal to share of the cross-sectional area of top going to sawn wood, i.e., it is used here for all log lengths. An increasing function</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          f 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mfrac> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               d 
             </mi> 
             <mrow> 
              <mi>
                t 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                p 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              y 
            </mi> 
            <mi>
              l 
            </mi> 
           </mrow> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               d 
             </mi> 
             <mrow> 
              <mi>
                t 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                p 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
        </mfrac> 
       </mrow> 
      </math> (3)</p>
     <p>is used to describe 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mrow> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              y 
            </mi> 
            <mi>
              l 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math>. For pricing and theoretical analysis, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          f 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> needs to be continuous. In practical sawing, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mrow> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              y 
            </mi> 
            <mi>
              l 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math> varies in jumps, and for a given 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           d 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>, there can be several feasible blade settings with different ratios. If a sawmill gets side boards only from two sides, its 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          f 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> starts to decrease when 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           d 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> is larger than 25 cm. Most sawmills have upper bounds for diameters. 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          f 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> assumed in the study defines a sawn wood reference value.</p>
     <p>Different sawn products have different values depending on the dimensions of the products and their quality. More valuable products are obtained from larger</p>
     <fig id="fig1" position="float">
      <label>Figure 1</label>
      <caption>
       <title>Figure 1. Sawn products produced with a blade setting. Note that the log is without bark. Figure is provided by Antti Heikkilä.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1621033-rId185.jpeg?20240624105414" />
     </fig>
     <p>top diameters. The center yield has larger value than the side boards. The value of the sawn wood is used here in the optimization of bucking. The value depends on the top diameter of the log. The relative value of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> is described with function</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           u 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mfrac> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
            <mi>
              u 
            </mi> 
           </mrow> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               d 
             </mi> 
             <mrow> 
              <mi>
                t 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                p 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               d 
             </mi> 
             <mrow> 
              <mi>
                t 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                p 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
        </mfrac> 
       </mrow> 
      </math> (4)</p>
     <p>where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> is the volume of sawn wood and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> is its value. Function 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          u 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> needs to be continuous in a theoretical analysis. Function 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          u 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> is scaled so that when the bucking maximizes the total value of logs using the default bucking parameters, the values add up to the total volume of the sawn wood. The scale of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          u 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> depends on the used data. For pricing, function 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          f 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> needs to be decided, not estimated. The sawn wood potential pricing separates amount and value and uses 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          f 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> to compute the amount after making a correction needed to consider that 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           D 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> is used instead of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           d 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. Buyers can utilize 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          u 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> to set price for 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>.</p>
     <p>Antti Heikkilä (personal communication) gave me volume of sawn wood, its value computed from the values of obtained products using prices seen in practice, the volume of saw dust and its value for eight blade settings for five top diameters. The volumes were computed for 48.5 dm logs. One setting was from p. 52 of <xref ref-type="bibr" rid="scirp.133979-18">
       Räsänen et al. (2017)
      </xref> without values of sawn products.</p>
     <p>Both 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          f 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          u 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> are described with the rectangular hyperbola used often to describe photosynthesis as a function of radiation. It has several parameterizations <xref ref-type="bibr" rid="scirp.133979-16">
       (Mehtätalo &amp; Lappi, 2020)
      </xref>. For a visual determination of the parameters, the expected-value parameterization of <xref ref-type="bibr" rid="scirp.133979-19">
       Ratkowsky (1990)
      </xref> going through points 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             y 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             y 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> is used:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          y 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mfrac> 
         <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               d 
             </mi> 
             <mn>
               2 
             </mn> 
            </msub> 
            <mo>
              − 
            </mo> 
            <msub> 
             <mi>
               d 
             </mi> 
             <mn>
               1 
             </mn> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <msub> 
           <mi>
             y 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <msub> 
           <mi>
             y 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
         </mrow> 
         <mrow> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               d 
             </mi> 
             <mrow> 
              <mi>
                t 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                p 
              </mi> 
             </mrow> 
            </msub> 
            <mo>
              − 
            </mo> 
            <msub> 
             <mi>
               d 
             </mi> 
             <mn>
               1 
             </mn> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <msub> 
           <mi>
             y 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <mo>
            + 
          </mo> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               d 
             </mi> 
             <mn>
               2 
             </mn> 
            </msub> 
            <mo>
              − 
            </mo> 
            <msub> 
             <mi>
               d 
             </mi> 
             <mrow> 
              <mi>
                t 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                p 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <msub> 
           <mi>
             y 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
         </mrow> 
        </mfrac> 
       </mrow> 
      </math> (5)</p>
     <fig id="fig2" position="float">
      <label>Figure 2</label>
      <caption>
       <title>Figure 2. Blue points show 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mrow>
   
           <mrow> 
    
            <msub> 
     
             <mi>
               V 
             </mi> 
     
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow>
   
           <mo>
            
    /
   
           </mo>
   
           <mrow> 
    
            <msub> 
     
             <mi>
               V 
             </mi> 
     
             <mrow> 
              <mi>
                c 
              </mi> 
              <mi>
                y 
              </mi> 
              <mi>
                l 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow>
  
          </mrow> 
 
         </mrow>

        </math>, (

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> is the volume of sawn wood, and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     y
    
            </mi>
    
            <mi>
             
     l
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> volume of without-barklog cylinder) for six blade settings and 48.5 dm logs. Red points are for ratio 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mrow>
   
           <mrow> 
    
            <msub> 
     
             <mi>
               V 
             </mi> 
     
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
              <mi>
                u 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow>
   
           <mo>
            
    /
   
           </mo>
   
           <mrow> 
    
            <msub> 
     
             <mi>
               V 
             </mi> 
     
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow>
  
          </mrow> 
 
         </mrow>

        </math> where 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
    
            <mi>
             
     u
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> is the relative value of obtained sawn wood volume. 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    d
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     t
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     p
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> is the without-bark top diameter of the sawlog. Squares show the points 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mrow> 
    
            <msub> 
     
             <mi>
               d 
             </mi> 
     
             <mn>
               1 
             </mn> 
    
            </msub> 
    
            <mo>
             
     ,
    
            </mo>
    
            <msub> 
     
             <mi>
               y 
             </mi> 
     
             <mn>
               1 
             </mn> 
    
            </msub> 
   
           </mrow> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
 
         </mrow>

        </math> and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mrow> 
    
            <msub> 
     
             <mi>
               d 
             </mi> 
     
             <mn>
               2 
             </mn> 
    
            </msub> 
    
            <mo>
             
     ,
    
            </mo>
    
            <msub> 
     
             <mi>
               y 
             </mi> 
     
             <mn>
               2 
             </mn> 
    
            </msub> 
   
           </mrow> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
 
         </mrow>

        </math> in Equation (5) used to define 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   f
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mrow> 
    
            <msub> 
     
             <mi>
               d 
             </mi> 
     
             <mrow> 
              <mi>
                t 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                p 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
 
         </mrow>

        </math> and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   u
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mrow> 
    
            <msub> 
     
             <mi>
               d 
             </mi> 
     
             <mrow> 
              <mi>
                t 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                p 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
 
         </mrow>

        </math> (Equations 3 and 4) and used via 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   f
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mrow> 
    
            <msub> 
     
             <mi>
               D 
             </mi> 
     
             <mrow> 
              <mi>
                t 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                p 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
 
         </mrow>

        </math> and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   u
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mrow> 
    
            <msub> 
     
             <mi>
               D 
             </mi> 
     
             <mrow> 
              <mi>
                t 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                p 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
 
         </mrow>

        </math> in Equations (6) and (7). Orange curve shows the value of log combining the volume of sawn wood, 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math>, and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   u
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mrow> 
    
            <msub> 
     
             <mi>
               d 
             </mi> 
     
             <mrow> 
              <mi>
                t 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                p 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
 
         </mrow>

        </math>.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1621033-rId233.jpeg?20240624105414" />
     </fig>
     <p>In bucking and sawing 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> needs to be computed from with-bark top diameter 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           D 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. It was found that it can be very well predicted using 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           D 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> as the argument in 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          f 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mtext>
             
         </mtext> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> and using a correction coefficient which can be computed by regressing 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          f 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <msubsup> 
         <mi>
           d 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
         <mn>
           2 
         </mn> 
        </msubsup> 
       </mrow> 
      </math> on 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          f 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <msubsup> 
         <mi>
           D 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
         <mn>
           2 
         </mn> 
        </msubsup> 
       </mrow> 
      </math> without intercept.</p>
     <p>The sawn wood volume 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> (dm<sup>3</sup>) of a sawlog with length L (dm) and with-bark top diameter 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           D 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> (cm) can then be computed using</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            L 
          </mi> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           c 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <mn>
          0.25 
        </mn> 
        <mi>
          π 
        </mi> 
        <mi>
          f 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <msubsup> 
         <mi>
           D 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
         <mn>
           2 
         </mn> 
        </msubsup> 
        <mi>
          L 
        </mi> 
       </mrow> 
      </math> (6)</p>
     <p>where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           c 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> is s species dependent coefficient. Regression provided 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           c 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            n 
          </mi> 
          <mi>
            e 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mtext>
          0 
        </mtext> 
        <mtext>
          .900 
        </mtext> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           c 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            p 
          </mi> 
          <mi>
            r 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            c 
          </mi> 
          <mi>
            e 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mtext>
          0 
        </mtext> 
        <mtext>
          .873 
        </mtext> 
       </mrow> 
      </math> ( 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msup> 
         <mi>
           R 
         </mi> 
         <mn>
           2 
         </mn> 
        </msup> 
        <mo>
          = 
        </mo> 
        <mn>
          0.994 
        </mn> 
       </mrow> 
      </math> for both regressions). Measurements such that 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          L 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           D 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          ≥ 
        </mo> 
        <mn>
          37 
        </mn> 
        <mtext>
            
        </mtext> 
        <mtext>
          dm 
        </mtext> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          D 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           L 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          ≥ 
        </mo> 
        <mn>
          14 
        </mn> 
        <mtext>
            
        </mtext> 
        <mtext>
          cm 
        </mtext> 
       </mrow> 
      </math> were used. The coefficients agree well with the rule of thumb that bark is 10% of the log volume.</p>
     <p>The value weighted sawn wood volume 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> was scaled ( 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           y 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           y 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
      </math> multiplied with the same number) so that when 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> is maximized with default bucking parameters, the average 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> is equal to average 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. The scaling takes the with-bark correction automatically into account. Thus</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            v 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            L 
          </mi> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mi>
          u 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            L 
          </mi> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> (7)</p>
     <p>The y-values for u were after scaling: 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          u 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            15 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mn>
          1.012 
        </mn> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          u 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            30 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mn>
          1.1956 
        </mn> 
       </mrow> 
      </math>. Multiplying these with 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           c 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            n 
          </mi> 
          <mi>
            e 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> provides the read squares in <xref ref-type="fig" rid="fig2">
       Figure 2
      </xref>, i.e. 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           y 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mn>
          0.9105 
        </mn> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           y 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mn>
          1.076 
        </mn> 
       </mrow> 
      </math>.</p>
    </sec>
    <sec id="s4_2">
     <title>4.2. Log Cylinder, Sawn Wood, and Chips</title>
     <p>Let us then look at the components of stems. The basic set-up can be seen from <xref ref-type="fig" rid="fig3">
       Figure 3
      </xref> for a stem producing one sawlog. The log is assumed to be cut at the length (not ‘height’) where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          D 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           L 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mn>
          16 
        </mn> 
        <mtext>
            
        </mtext> 
        <mtext>
          cm 
        </mtext> 
       </mrow> 
      </math>, leading to L = 50 dm. The blue rectangle shows the with-bark log cylinder. The log cylinder is decomposed into sawn wood 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> (including saw dust) and with-bark in-chips 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            I 
          </mi> 
          <mi>
            N 
          </mi> 
          <mi>
            C 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> using equation (6). Within a sawlog, volume outside the with-bark log cylinder provides out-chips, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            O 
          </mi> 
          <mi>
            U 
          </mi> 
          <mi>
            T 
          </mi> 
          <mi>
            C 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> which contains bark.</p>
     <p>Volumes are integrated cross-sectional areas. Thus 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          D 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           L 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> does not show properly the effect of stem curve on the volume. The green curve in <xref ref-type="fig" rid="fig3">
       Figure 3
      </xref> shows the (scaled) cross-sectional area, the green curves in <xref ref-type="fig" rid="fig4">
       Figure 4
      </xref> (left) and <xref ref-type="fig" rid="fig5">
       Figure 5
      </xref> show the integrated cross-sectional area, i.e., volume.</p>
     <p>Remarks from <xref ref-type="fig" rid="figFigures 3-6">
       Figures 3-6
      </xref>:</p>
     <fig id="fig3" position="float">
      <label>Figure 3</label>
      <caption>
       <title>Figure 3. A typical one-log stem of Scots Pine. The x-axis 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
          
  L
 
         </mi>

        </math> is the length from the stump. The black curve is 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   D
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mi>
            
    L
   
           </mi> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
 
         </mrow>

        </math> (scale in y-axis). The blue rectangle is the log cylinder of the log cut at 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
          
  L
 
         </mi>

        </math> = 50 dm where 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   D
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mi>
            
    L
   
           </mi> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
  
          <mo>
           
   =
  
          </mo>
  
          <mn>
           
   16
  
          </mn>
  
          <mtext>
           
    
  
          </mtext>
  
          <mtext>
           
    cm
  
          </mtext>
 
         </mrow>

        </math>. The green curve is the cross-sectional area 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   A
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mi>
            
    L
   
           </mi> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
 
         </mrow>

        </math> scaled to coincide with the top right corner of the log cylinder. The vertical orange line at 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   L
  
          </mi>
  
          <mo>
           
   =
  
          </mo>
  
          <mn>
           
   125
  
          </mn>
 
         </mrow>

        </math> dm shows the length of the commercial stem, i.e., 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   D
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mrow> 
    
            <mn>
             
     125
    
            </mn>
   
           </mrow> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
  
          <mo>
           
   =
  
          </mo>
  
          <mn>
           
   5
  
          </mn>
  
          <mtext>
           
    
  
          </mtext>
  
          <mtext>
           
    cm
  
          </mtext>
  
          <mo>
           
   =
  
          </mo>
  
          <msub> 
   
           <mi>
            
    d
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     min
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math>, 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    d
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     min
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> being the diameter limit for pulp wood. In the legend, 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     log
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math>, 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     y
    
            </mi>
    
            <mi>
             
     l
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math>, 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     p
    
            </mi>
    
            <mi>
             
     u
    
            </mi>
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     p
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> are volume percentages of the sawlog, log cylinder, sawn wood and pulp wood, respectively, from the commercial volume 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     m
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math>.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1621033-rId382.jpeg?20240624105415" />
     </fig>
     <fig id="fig4" position="float">
      <label>Figure 4</label>
      <caption>
       <title>Figure 4. Left subfigure shows volume components 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     log
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math>, 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     y
    
            </mi>
    
            <mi>
             
     l
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math>, and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> for the stem shown in Figure 3 if the sawlog is cut at length 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
          
  L
 
         </mi>

        </math> on the x-axes. The curves are scaled so that they cross 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   D
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mi>
            
    L
   
           </mi> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
 
         </mrow>

        </math> at 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
          
  L
 
         </mi>

        </math> = 50 dm, which was the log length in Figure 3. 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
    
            <mi>
             
     u
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> refers to value weighted sawn wood volume which is scaled similarly. The legend shows what 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
          
  L
 
         </mi>

        </math>, 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     g
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math>, 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     y
    
            </mi>
    
            <mi>
             
     l
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math>, 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
    
            <mi>
             
     u
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> would result if 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     y
    
            </mi>
    
            <mi>
             
     l
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math>, 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> or 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
    
            <mi>
             
     u
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> is maximized. Right subfigure shows the ratio of the value of the stem computed with 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    P
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <mo>
           
   +
  
          </mo>
  
          <msub> 
   
           <mi>
            
    P
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     h
    
            </mi>
    
            <mi>
             
     i
    
            </mi>
    
            <mi>
             
     p
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     t
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     t
    
            </mi>
    
            <mi>
             
     c
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> to the optimal value of 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    P
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> for different values of 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mrow>
   
           <mrow> 
    
            <msub> 
     
             <mi>
               P 
             </mi> 
     
             <mrow> 
              <mi>
                c 
              </mi> 
              <mi>
                h 
              </mi> 
              <mi>
                i 
              </mi> 
              <mi>
                p 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow>
   
           <mo>
            
    /
   
           </mo>
   
           <mrow> 
    
            <msub> 
     
             <mi>
               P 
             </mi> 
     
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow>
  
          </mrow> 
 
         </mrow>

        </math> shown at the end of each curve. Because the optimal sawn wood percentage 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mrow>
   
           <mrow> 
    
            <msub> 
     
             <mi>
               V 
             </mi> 
     
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow>
   
           <mo>
            
    /
   
           </mo>
   
           <mrow> 
    
            <msub> 
     
             <mi>
               V 
             </mi> 
     
             <mrow> 
              <mi>
                c 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                m 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow>
  
          </mrow> 
 
         </mrow>

        </math> is smaller than 50%, the curve for 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    P
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     h
    
            </mi>
    
            <mi>
             
     i
    
            </mi>
    
            <mi>
             
     p
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <mo>
           
   =
  
          </mo>
  
          <msub> 
   
           <mi>
            
    P
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> is higher than 2. Red curve on the right is the same 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> curve as on the left. The range of feasible values of 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
          
  L
 
         </mi>

        </math> is shown for both figures for 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    L
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     min
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <mo>
           
   =
  
          </mo>
  
          <mn>
           
   37
  
          </mn>
 
         </mrow>

        </math> dm, 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    L
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     max
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <mo>
           
   =
  
          </mo>
  
          <mn>
           
   58
  
          </mn>
 
         </mrow>

        </math> dm, and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    D
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     min
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <mo>
           
   =
  
          </mo>
  
          <mn>
           
   14
  
          </mn>
 
         </mrow>

        </math> cm.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1621033-rId409.jpeg?20240624105415" />
     </fig>
     <fig id="fig5" position="float">
      <label>Figure 5</label>
      <caption>
       <title>Figure 5. An example of a stem where maximization of 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> produces two logs. The thin blue and red lines show how 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     y
    
            </mi>
    
            <mi>
             
     l
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> had continued if the first log had not been cut at 55 dm which was the maximum length of sawlogs, 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    L
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     max
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math>. Note that 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    D
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     t
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     p
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> of the second log was larger than 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    D
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     min
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> = 15 cm, the assumed minimum top diameter, and log length 40 dm had also allowed a longer log. Thus, maximization of 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     g
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> are in conflict. Note the sharp bend of 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     y
    
            </mi>
    
            <mi>
             
     l
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> on the thin lines. The bend of 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   D
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mi>
            
    L
   
           </mi> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
 
         </mrow>

        </math> is mild at the same 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
          
  L
 
         </mi>

        </math>. The volume curves are at the same scale, which is different from 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   D
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mi>
            
    L
   
           </mi> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
 
         </mrow>

        </math>.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1621033-rId460.jpeg?20240624105415" />
     </fig>
     <fig id="fig6" position="float">
      <label>Figure 6</label>
      <caption>
       <title>Figure 6. Randomly selected examples of 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> as a function of 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     g
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> for the last log when making initially logs using 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    L
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     min
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> = 40 dm. End points of lines are obtained using 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
          
  L
 
         </mi>

        </math> (shown with number) where 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   D
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mi>
            
    L
   
           </mi> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
 
         </mrow>

        </math> = 15 cm. Blue points are for 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
          
  L
 
         </mi>

        </math> = 37 dm, the smallest 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    L
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     min
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> used in the paper, and red points are for 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
          
  L
 
         </mi>

        </math> which is the minimum of 58 dm and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
          
  L
 
         </mi>

        </math> producing 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   D
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mi>
            
    L
   
           </mi> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
 
         </mrow>

        </math> = 15 cm. The number at the top of a curve shows the log length where the maximum sawn wood is obtained.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1621033-rId487.jpeg?20240624105415" />
     </fig>
    </sec>
    <sec id="s4_3">
     <title>4.3. Relations of Volume Components</title>
     <p>This section describes some empirical relations between stem components in the pine data when logs are bucked maximizing 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>, the value-weighted amount of sawn wood using the default bucking parameters 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           L 
         </mi> 
         <mrow> 
          <mi>
            min 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mtext>
          4 
        </mtext> 
        <mn>
          0 
        </mn> 
        <mtext>
            
        </mtext> 
        <mtext>
          dm 
        </mtext> 
       </mrow> 
      </math>, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           L 
         </mi> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mn>
          55 
        </mn> 
        <mtext>
            
        </mtext> 
        <mtext>
          dm 
        </mtext> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           D 
         </mi> 
         <mrow> 
          <mi>
            min 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mn>
          15 
        </mn> 
        <mtext>
            
        </mtext> 
        <mtext>
          cm 
        </mtext> 
       </mrow> 
      </math>. <xref ref-type="fig" rid="fig7">
       Figure 7
      </xref> shows how relative components depend on 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           D 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>, the top diameter of log, and log volume 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. <xref ref-type="fig" rid="fig8">
       Figure 8
      </xref> shows share of components from 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            m 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> with respect to dbh (left) and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            m 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> of the stem (right).</p>
     <p>Remarks:</p>
     <fig id="fig7" position="float">
      <label>Figure 7</label>
      <caption>
       <title>Figure 7. Relative volumes of log components from the total log volume as a function of the log size, on the left with respect to 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    D
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     t
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     p
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math>, the value-weighted sawn wood 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
    
            <mi>
             
     u
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> is also drawn with thin orange line. As log length has trivial effect on the components, all logs are 40 dm long (the lower part of longer logs is ignored). The thin error bars show the standard deviation in each class, the thick error bar shows the standards error of mean computed as 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mrow>
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     d
    
            </mi>
   
           </mrow>
   
           <mo>
            
    /
   
           </mo>
   
           <mrow> 
    
            <msqrt> 
     
             <mi>
               n 
             </mi> 
    
            </msqrt> 
   
           </mrow>
  
          </mrow> 
 
         </mrow>

        </math>. When 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    D
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     t
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     p
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> and 

        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
          
  L
 
         </mi>

        </math> are fixed then 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     y
    
            </mi>
    
            <mi>
             
     l
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math>, (12) 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     i
    
            </mi>
    
            <mi>
             
     n
    
            </mi>
    
            <mi>
             
     c
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> are constants. The variation of the share of 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     y
    
            </mi>
    
            <mi>
             
     l
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> is caused by the variation of 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     g
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math>. In grouping, 20 classes of equal length are first formed, and then classes are merged until each class has at least seven observations.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1621033-rId577.jpeg?20240624105416" />
     </fig>
     <fig id="fig8" position="float">
      <label>Figure 8</label>
      <caption>
       <title>Figure 8. Relative volumes of log components from the total commercial volume 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     m
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> of the stem as a function of dbh (left) and commercial volume 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     m
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> (right). The relations are more nonlinear than log-wise percentages in <xref ref-type="fig" rid="fig7">
         Figure 7
        </xref>. Note that 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mn>
           
   100
  
          </mn>
  
          <mo>
           
   −
  
          </mo>
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> is the share of total amount of chips, 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     t
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     t
    
            </mi>
    
            <mi>
             
     c
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math>. Also 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
    
            <mi>
             
     u
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> is drawn with thin orange line. Error bars as in <xref ref-type="fig" rid="fig7">
         Figure 7
        </xref>.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1621033-rId600.jpeg?20240624105416" />
     </fig>
     <p>In the assortment pricing the price is given for the sawlog volume without considering the size of the tree. In the sawn wood potential pricing, price is given to 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> without considering that larger top diameters provide more valuable sawn products. The close relation between thin and thick orange lines in <xref ref-type="fig" rid="fig8">
       Figure 8
      </xref> shows that 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> considers most part of the utility of larger trees. Further details are given later.</p>
    </sec>
   </sec>
   <sec id="s5">
    <title>5. Bucking</title>
    <sec id="s5_1">
     <title>5.1. Generating All Bucking Schedules</title>
     <p>The bucking can be optimized with respect to any log variables by selecting the best bucking schedule among all feasible bucking schedules. A bucking schedule tells the lengths of logs. The algorithm below is used to generate all bucking schedules obeying bucking parameters 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           L 
         </mi> 
         <mrow> 
          <mi>
            min 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           L 
         </mi> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           D 
         </mi> 
         <mrow> 
          <mi>
            min 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>, and assuming that sawlogs step in 3 dm steps. If it is not allowed to leave a possible sawlog to the pulp wood, the following algorithm implemented in stemopt in Fortran 90 generates all possible schedules:</p>
     <p>do ilog1=Lmin,min(loglentot,Lmax),3</p>
     <p>loglen(1)=ilog1 ! loglen = length of the log</p>
     <p>loglenc(1)=ilog1 ! loglenc = cumulative length</p>
     <p>nlog=1 ! nlog = number of logs</p>
     <p>if(loglentot-loglenc(1).ge.Lmin)then</p>
     <p>do ilog2=Lmin,min(loglentot-loglenc(1),Lmax),3</p>
     <p>loglen(2)=ilog2</p>
     <p>loglenc(2)=loglenc(1)+ilog2</p>
     <p>nlog=2</p>
     <p>if(loglentot-loglenc(2).ge.Lmin)then</p>
     <p>Nesting goes up to level 6</p>
     <p>else</p>
     <p>call compute() ! two logs are possible nlog=2</p>
     <p>endif !if(loglentot-loglenc(2).ge.Lmin)</p>
     <p>enddo !ilog2=Lmin,min(loglentot-loglenc(1),Lmax),3</p>
     <p>else</p>
     <p>call compute() ! only one log is possible nlog=1</p>
     <p>endif !if(loglentot-loglenc(1).ge.Lmin) enddo</p>
     <p>The subroutine compute computes the objective and updates the current solution if the schedule is better than current optimum. In the data sets of Luke and with the used parameters the maximum number of logs was 5. The loops go now to level 6. More levels can be easily added. When generating all possible schedules allowing the pulp part to contain potential sawlogs, then if-then-else structures are dropped.</p>
     <p>Researchers have developed bucking algorithms based on recursion or dynamic programming (e.g. <xref ref-type="bibr" rid="scirp.133979-3">
       Gronding, 1998
      </xref>). The above algorithm, used e.g. in <xref ref-type="bibr" rid="scirp.133979-17">
       Näsberg (1985)
      </xref>, is simple and fast. Bucking optimization of 2169 trees in Luke’s pine data took 0.14 secs of CPU time in my ancient laptop, when all possible output variables were produced. It is possible, also in stemopt, to put further restrictions to allowable logs. Setting small values to 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           L 
         </mi> 
         <mrow> 
          <mi>
            min 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           D 
         </mi> 
         <mrow> 
          <mi>
            min 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>, and a large value to 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           L 
         </mi> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and putting restrictions to allowable logs, allows arbitrary log dimension definitions.</p>
     <p>All variable needed in this paper are produced by stemopt. The objective can be given in terms of these variables either as a one mathematical statement possibly also containing matrix algebra, or using a separate function which can loop over logs. The optimization means selecting the schedule with the largest value of the objective. If the compute-subroutine is asked to write the schedule variables into the disk, the resulting data has the same structure for which the linear programming algorithm of Jlp22 is designed. Trees correspond to stands in management planning problems.</p>
    </sec>
    <sec id="s5_2">
     <title>5.2. Influence of Bucking Parameters and Simple Objectives</title>
     <p>Bucking parameters determine the range of possible bucking results for any objective. The assortment pricing gives much freedom to the buyer to decide the sawlog percentage. 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mrow> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              l 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              g 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              m 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mrow> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              m 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math> were computed for eight bucking parameter combinations and seven objectives. The objectives were: 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mrow> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              l 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              g 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math>, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          − 
        </mo> 
        <mi>
          ε 
        </mi> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          + 
        </mo> 
        <mi>
          ε 
        </mi> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          + 
        </mo> 
        <mi>
          ε 
        </mi> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          − 
        </mo> 
        <mi>
          ε 
        </mi> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. Maximization of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> means minimization of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. Same 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> can be obtained with different log lengths when more than one log is bucked. The 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
         ε 
       </mi> 
      </math>-component with small 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
         ε 
       </mi> 
      </math> was used to maximize or minimize 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> for the same maximal 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. If the capacity restricts the production instead number of available stands, an independent sawmill may consider maximizing 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mrow> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
            <mi>
              u 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              l 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              g 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math>. Objectives depending on the stumpage price and prices of products are discussed later. In the assortment pricing, a forest owner would like that the buyer would maximize 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and fears that the buyer minimizes 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>.</p>
     <table-wrap id="table1">
      <label>
       <xref ref-type="table" rid="table1">
        Table 1
       </xref></label>
      <caption>
       <title>
        <xref ref-type="bibr" rid="scirp.133979-"></xref>Table 1. 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mrow>
   
           <mrow> 
    
            <msub> 
     
             <mi>
               V 
             </mi> 
     
             <mrow> 
              <mi>
                l 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                g 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow>
   
           <mo>
            
    /
   
           </mo>
   
           <mrow> 
    
            <msub> 
     
             <mi>
               V 
             </mi> 
     
             <mrow> 
              <mi>
                c 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                m 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow>
  
          </mrow> 
 
         </mrow>

        </math>, 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mrow>
   
           <mrow> 
    
            <msub> 
     
             <mi>
               V 
             </mi> 
     
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow>
   
           <mo>
            
    /
   
           </mo>
   
           <mrow> 
    
            <msub> 
     
             <mi>
               V 
             </mi> 
     
             <mrow> 
              <mi>
                c 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                m 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow>
  
          </mrow> 
 
         </mrow>

        </math> and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mrow>
   
           <mrow> 
    
            <msub> 
     
             <mi>
               V 
             </mi> 
     
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
              <mi>
                u 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow>
   
           <mo>
            
    /
   
           </mo>
   
           <mrow> 
    
            <msub> 
     
             <mi>
               V 
             </mi> 
     
             <mrow> 
              <mi>
                c 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                m 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow>
  
          </mrow> 
 
         </mrow>

        </math> multiplied with 100 when objectives shown in the top are maximized.Table 1. V log / V com , V saw / V com and V sawu / V com multiplied with 100 when objectives shown in the top are maximized.</title>
      </caption>
      <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
       <tr> 
        <td class="custom-bottom-td acenter" width="15.47%"><p style="text-align:center">Max</p><p style="text-align:center"> 
          <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
            <mrow> 
             <mtext>
                 
             </mtext> 
             <mo>
               / 
             </mo> 
             <mrow> 
              <msub> 
               <mi>
                 V 
               </mi> 
               <mrow> 
                <mi>
                  c 
                </mi> 
                <mi>
                  o 
                </mi> 
                <mi>
                  m 
                </mi> 
               </mrow> 
              </msub> 
             </mrow> 
            </mrow> 
           </mrow> 
          </math></p></td> 
        <td class="custom-bottom-td acenter" width="10.51%"><p style="text-align:center"> 
          <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
          </math></p></td> 
        <td class="custom-bottom-td acenter" width="10.49%"><p style="text-align:center"> 
          <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
              <mi>
                u 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
          </math></p></td> 
        <td class="custom-bottom-td acenter" width="11.11%"><p style="text-align:center"> 
          <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
            <mfrac> 
             <mrow> 
              <msub> 
               <mi>
                 V 
               </mi> 
               <mrow> 
                <mi>
                  s 
                </mi> 
                <mi>
                  a 
                </mi> 
                <mi>
                  w 
                </mi> 
               </mrow> 
              </msub> 
             </mrow> 
             <mrow> 
              <msub> 
               <mi>
                 V 
               </mi> 
               <mrow> 
                <mi>
                  l 
                </mi> 
                <mi>
                  o 
                </mi> 
                <mi>
                  g 
                </mi> 
               </mrow> 
              </msub> 
             </mrow> 
            </mfrac> 
           </mrow> 
          </math></p></td> 
        <td class="custom-bottom-td acenter" width="13.64%"><p style="text-align:center"> 
          <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
            <mo>
              − 
            </mo> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                l 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                g 
              </mi> 
             </mrow> 
            </msub> 
            <mo>
              − 
            </mo> 
            <mi>
              ε 
            </mi> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
          </math></p></td> 
        <td class="custom-bottom-td acenter" width="13.64%"><p style="text-align:center"> 
          <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
            <mo>
              − 
            </mo> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                l 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                g 
              </mi> 
             </mrow> 
            </msub> 
            <mo>
              + 
            </mo> 
            <mi>
              ε 
            </mi> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
          </math></p></td> 
        <td class="custom-bottom-td acenter" width="13.64%"><p style="text-align:center"> 
          <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                l 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                g 
              </mi> 
             </mrow> 
            </msub> 
            <mo>
              + 
            </mo> 
            <mi>
              ε 
            </mi> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
          </math></p></td> 
        <td class="custom-bottom-td acenter" width="13.64%"><p style="text-align:center"> 
          <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                l 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                g 
              </mi> 
             </mrow> 
            </msub> 
            <mo>
              − 
            </mo> 
            <mi>
              ε 
            </mi> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
          </math></p></td> 
       </tr> 
       <tr> 
        <td class="custom-top-td acenter" width="15.47%"><p style="text-align:center"> 
          <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                l 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                g 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
          </math></p></td> 
        <td class="custom-top-td acenter" width="10.51%"><p style="text-align:center">90.3</p></td> 
        <td class="custom-top-td acenter" width="10.49%"><p style="text-align:center">89.5</p></td> 
        <td class="custom-top-td acenter" width="11.11%"><p style="text-align:center">82.1</p></td> 
        <td class="custom-top-td acenter" width="13.64%"><p style="text-align:center">78.1</p></td> 
        <td class="custom-top-td acenter" width="13.64%"><p style="text-align:center">78.1</p></td> 
        <td class="custom-top-td acenter" width="13.64%"><p style="text-align:center">92.3</p></td> 
        <td class="custom-top-td acenter" width="13.64%"><p style="text-align:center">92.3</p></td> 
       </tr> 
       <tr> 
        <td class="acenter" width="15.47%"><p style="text-align:center"> 
          <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
          </math></p></td> 
        <td class="acenter" width="10.51%"><p style="text-align:center">48.6</p></td> 
        <td class="acenter" width="10.49%"><p style="text-align:center">48.5</p></td> 
        <td class="acenter" width="11.11%"><p style="text-align:center">45.9</p></td> 
        <td class="acenter" width="13.64%"><p style="text-align:center">42.0</p></td> 
        <td class="acenter" width="13.64%"><p style="text-align:center">42.50</p></td> 
        <td class="acenter" width="13.64%"><p style="text-align:center">46.6</p></td> 
        <td class="acenter" width="13.64%"><p style="text-align:center">47.6</p></td> 
       </tr> 
       <tr> 
        <td class="acenter" width="15.47%"><p style="text-align:center"> 
          <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
              <mi>
                u 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
          </math></p></td> 
        <td class="acenter" width="10.51%"><p style="text-align:center">48.4</p></td> 
        <td class="acenter" width="10.49%"><p style="text-align:center">48.4</p></td> 
        <td class="acenter" width="11.11%"><p style="text-align:center">46.3</p></td> 
        <td class="acenter" width="13.64%"><p style="text-align:center">42.3</p></td> 
        <td class="acenter" width="13.64%"><p style="text-align:center">42.8</p></td> 
        <td class="acenter" width="13.64%"><p style="text-align:center">46.0</p></td> 
        <td class="acenter" width="13.64%"><p style="text-align:center">47.2</p></td> 
       </tr> 
      </table>
     </table-wrap>
     <fig id="fig9" position="float">
      <label>Figure 9</label>
      <caption>
       <title>Figure 9. Bucking results for different bucking parameters shown in the bottom of the columns. The horizontal lines in the middle show the percentage of the volume of sawn wood 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> from the total commercial volume 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     m
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> for objectives shown in the legends. The upper horizontal lines show the percentages of 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     g
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> from 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     m
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math>. Columns are ordered according to 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mrow>
   
           <mrow> 
    
            <msub> 
     
             <mi>
               V 
             </mi> 
     
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow>
   
           <mo>
            
    /
   
           </mo>
   
           <mrow> 
    
            <msub> 
     
             <mi>
               V 
             </mi> 
     
             <mrow> 
              <mi>
                c 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                m 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow>
  
          </mrow> 
 
         </mrow>

        </math>. The middle column is for the default bucking parameters.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1621033-rId704.jpeg?20240624105418" />
     </fig>
     <p>Remarks:</p>
     <p>In the assortment pricing, different buyers use many other dimensions than present in <xref ref-type="fig" rid="fig9">
       Figure 9
      </xref>. Buyers can determine feasible log dimensions so that they are not forced to buck large 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. With a given set of allowable dimensions, the secret price matrices of buyers can give a wide range of sawlog percentages.</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> was maximized in the bucking for the same bucking parameter combinations as used above. Regression of total 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mn>
          100 
        </mn> 
        <mrow> 
         <mrow> 
          <msubsup> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
           <mrow> 
            <mi>
              max 
            </mi> 
           </mrow> 
          </msubsup> 
         </mrow> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              m 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math> on the bucking parameters produced the following equation. The bucking parameters were scaled to −1, 0, and 1.</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mn>
          100 
        </mn> 
        <mfrac> 
         <mrow> 
          <msubsup> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
           <mrow> 
            <mi>
              max 
            </mi> 
           </mrow> 
          </msubsup> 
         </mrow> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              m 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </mfrac> 
        <mo>
          = 
        </mo> 
        <mn>
          50.5 
        </mn> 
        <mo>
          − 
        </mo> 
        <mn>
          1.55 
        </mn> 
        <msub> 
         <mi>
           L 
         </mi> 
         <mrow> 
          <mi>
            min 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          + 
        </mo> 
        <mn>
          0.09 
        </mn> 
        <msub> 
         <mi>
           L 
         </mi> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          − 
        </mo> 
        <mn>
          1.91 
        </mn> 
        <msub> 
         <mi>
           D 
         </mi> 
         <mrow> 
          <mi>
            min 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> (8)</p>
     <p>RMSE of Equation (8) was 0.15 and t-values for the coefficients were −29.2, 1.7 and −36.9. Even if the regression equation is not estimated from data satisfying standard assumptions, the t-values and coefficients show that 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> depends on 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           L 
         </mi> 
         <mrow> 
          <mi>
            min 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           D 
         </mi> 
         <mrow> 
          <mi>
            min 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> in an anticipated way and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           L 
         </mi> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> is less important. If different buyers would use the sawn wood potential pricing but different bucking parameters, Equation (8) or its tuned version with quadratic terms could be used to make biddings comparable.</p>
    </sec>
    <sec id="s5_3">
     <title>5.3. Bucking Objectives in Free Bucking</title>
     <p>When optimizing bucking in each stand, only variable production costs need to be considered when computing the values of the produced logs. The harvest and transportation costs both to the nearest road and from there to the sawmill or pulp mill are variable costs. The pulping process does not allow decreasing fluently the production level and production costs. Sawmills are more flexible. When the production is decreased, a sawmill can save e.g. in the cost of electricity and the cost of drying sawn wood but not very flexibly in the cost of labor. At the theoretical level of this paper, also the production costs at sawmills can be treated as fixed.</p>
     <p>Utilizing the stem components, we may assume that a sawmill gets the net income:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          U 
        </mi> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            m 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> (9)</p>
     <p>where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> are the net prices of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>, respectively, after subtracting the variable costs and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            m 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> is the stumpage price. 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            m 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> is always dependent on the stem properties. But if 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            m 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> does not depend on the actual bucking, Equation (9) can be maximized by maximizing</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           U 
         </mi> 
         <mi>
           f 
         </mi> 
        </msub> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> (10)</p>
     <p>The subscript f of U refers to free bucking. We may assume that both sawmill types are in the same sawn wood market and have the same variable costs for sawmill production, even if sawmills with pulp may have some logistic savings if a sawmill is close to a pulp mill. Generally, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> may be the same for both. As results are computed for different values of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>, it is possible to compare one 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> for independent sawmills to another 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> for sawmills with pulp.</p>
     <p>For an independent sawmill 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> is the price of chips it gets from the market. For a sawmill with pulp, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> in Equation (10) is the value the company gives from chips coming from its own harvests. If there were perfect competition for chips, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> for a sawmill with pulp would basically have the same value as an independent sawmill gets from the market. Because the competition may not be perfect <xref ref-type="bibr" rid="scirp.133979-5">
       (Kallio, 2001)
      </xref>, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> may be higher for sawmills with pulp. In the following computations 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> is allowed to approach the value of sawn timber.</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> has evidently a different value for sawmills with pulp than for independent sawmills. As sawmills with pulp process 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> they are expecting to get also profit for 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. Chipping pulp wood and chipping the chip component 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> of sawlogs is so similar and the longer fibers coming from sawlogs are not much more valuable. We may assume that 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> for sawmills with pulp. As independent sawmills just transmit pulp wood to pulp mills, we may assume that they do not get any operating loss or operating profit from pulp wood, i.e., that for them 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mn>
          0 
        </mn> 
       </mrow> 
      </math>. Thus Equation (10) is interpreted to mean for independent sawmills</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           U 
         </mi> 
         <mrow> 
          <mi>
            f 
          </mi> 
          <mi>
            i 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> (11)</p>
     <p>and for sawmills with pulp</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           U 
         </mi> 
         <mrow> 
          <mi>
            f 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            c 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> (12)</p>
     <p>where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            c 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> is the total amount of chips coming both from sawlogs and pulp wood, i.e. 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            c 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. Currently, independent sawmills may get 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          ≈ 
        </mo> 
        <mn>
          40 
        </mn> 
        <mtext>
            
        </mtext> 
        <mrow> 
         <mi>
           € 
         </mi> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msup> 
           <mtext>
             m 
           </mtext> 
           <mtext>
             3 
           </mtext> 
          </msup> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math>.</p>
    </sec>
    <sec id="s5_4">
     <title>5.4. Bucking Objectives in Assortment Pricing</title>
     <p>In assortment pricing the stumpage price is dependent on the bucking. Profit maximization requires independent sawmills to maximize:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           U 
         </mi> 
         <mrow> 
          <mi>
            a 
          </mi> 
          <mi>
            i 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> (13)</p>
     <p>and sawmills with pulp may maximize</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           U 
         </mi> 
         <mrow> 
          <mi>
            a 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            c 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> (14)</p>
     <p>Computations are done assuming that 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mtext>
          75 
        </mtext> 
        <mtext>
            
        </mtext> 
        <mrow> 
         <mi>
           € 
         </mi> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msup> 
           <mtext>
             m 
           </mtext> 
           <mtext>
             3 
           </mtext> 
          </msup> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mtext>
          25 
        </mtext> 
        <mtext>
            
        </mtext> 
        <mrow> 
         <mi>
           € 
         </mi> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msup> 
           <mtext>
             m 
           </mtext> 
           <mtext>
             3 
           </mtext> 
          </msup> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math>, which agree approximate the price statistics of Northern Savo some time ago.</p>
    </sec>
    <sec id="s5_5">
     <title>5.5. Comparing Free Bucking and Assortment Pricing</title>
     <p>Remarks:</p>
     <fig id="fig10" position="float">
      <label>Figure 10</label>
      <caption>
       <title>Figure 10. Dependency of 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mrow>
   
           <mrow> 
    
            <msub> 
     
             <mi>
               V 
             </mi> 
     
             <mrow> 
              <mi>
                l 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                g 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow>
   
           <mo>
            
    /
   
           </mo>
   
           <mrow> 
    
            <msub> 
     
             <mi>
               V 
             </mi> 
     
             <mrow> 
              <mi>
                c 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                m 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow>
  
          </mrow> 
 
         </mrow>

        </math> (upper curves) and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mrow>
   
           <mrow> 
    
            <msub> 
     
             <mi>
               V 
             </mi> 
     
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow>
   
           <mo>
            
    /
   
           </mo>
   
           <mrow> 
    
            <msub> 
     
             <mi>
               V 
             </mi> 
     
             <mrow> 
              <mi>
                c 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                m 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow>
  
          </mrow> 
 
         </mrow>

        </math> (lower curves) on 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    P
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     h
    
            </mi>
    
            <mi>
             
     i
    
            </mi>
    
            <mi>
             
     p
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> for three values of 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    P
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> for both sawmill and pricing types. The right plot shows the behavior of 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mrow>
   
           <mrow> 
    
            <msub> 
     
             <mi>
               V 
             </mi> 
     
             <mrow> 
              <mi>
                l 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                g 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow>
   
           <mo>
            
    /
   
           </mo>
   
           <mrow> 
    
            <msub> 
     
             <mi>
               V 
             </mi> 
     
             <mrow> 
              <mi>
                c 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                m 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow>
  
          </mrow> 
 
         </mrow>

        </math>. Because 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     m
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <mo>
           
   =
  
          </mo>
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <mo>
           
   +
  
          </mo>
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     t
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     t
    
            </mi>
    
            <mi>
             
     c
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> and the volume of commercial volume 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     m
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> is fixed, decrease of sawn wood 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> implies increase of the total volume of chips 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     t
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     t
    
            </mi>
    
            <mi>
             
     c
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> with the same amount. Thus, distance of 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mrow>
   
           <mrow> 
    
            <msub> 
     
             <mi>
               V 
             </mi> 
     
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow>
   
           <mo>
            
    /
   
           </mo>
   
           <mrow> 
    
            <msub> 
     
             <mi>
               V 
             </mi> 
     
             <mrow> 
              <mi>
                c 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                m 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow>
  
          </mrow> 
 
         </mrow>

        </math> from the lower and upper margin should be considered simultaneously.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1621033-rId847.jpeg?20240624105421" />
     </fig>
     <fig id="fig11" position="float">
      <label>Figure 11</label>
      <caption>
       <title>Figure 11. Average log length as a function of 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    P
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     h
    
            </mi>
    
            <mi>
             
     i
    
            </mi>
    
            <mi>
             
     p
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> when Equations (11) - (14). Currently, independent sawmills may get 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    P
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     h
    
            </mi>
    
            <mi>
             
     i
    
            </mi>
    
            <mi>
             
     p
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <mo>
           
   ≈
  
          </mo>
  
          <mn>
           
   40
  
          </mn>
 
         </mrow>

        </math> €/m<sup>3</sup>. Note that log lengths approach the used 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    L
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     min
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <mo>
           
   =
  
          </mo>
  
          <mn>
           
   40
  
          </mn>
 
         </mrow>

        </math> but are much lower than 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    L
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     max
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <mo>
           
   =
  
          </mo>
  
          <mn>
           
   55
  
          </mn>
 
         </mrow>

        </math> dm.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1621033-rId868.jpeg?20240624105421" />
     </fig>
    </sec>
    <sec id="s5_6">
     <title>5.6. Stumpage Price in Both Pricings and Dead Weight Loss in Assortment Pricing</title>
     <p>Let U-values refer to optimal values when Equations (11) - (14) are maximized. In economics inefficiency resulting when market economy does not work properly is called deadweight loss. In the assortment pricing, deadweight loss for an independent sawmill is</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          D 
        </mi> 
        <mi>
          W 
        </mi> 
        <msub> 
         <mi>
           D 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           U 
         </mi> 
         <mrow> 
          <mi>
            f 
          </mi> 
          <mi>
            i 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           U 
         </mi> 
         <mrow> 
          <mi>
            a 
          </mi> 
          <mi>
            i 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> (15)</p>
     <p>and for sawmill with pulp the deadweight loss is</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          D 
        </mi> 
        <mi>
          W 
        </mi> 
        <msub> 
         <mi>
           D 
         </mi> 
         <mi>
           p 
         </mi> 
        </msub> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           U 
         </mi> 
         <mrow> 
          <mi>
            f 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           U 
         </mi> 
         <mrow> 
          <mi>
            a 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> (16)</p>
     <p>Before finding the proper term in economics, I called dead weight loss ‘black hole’, which might be easier for non-economists to understand.</p>
     <p>Some comments made in previous section could be repeated. Following additional remarks can be made:</p>
     <fig id="fig12" position="float">
      <label>Figure 12</label>
      <caption>
       <title>Figure 12. ‘Stumpage price’ 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    p
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     g
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     g
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <mo>
           
   +
  
          </mo>
  
          <msub> 
   
           <mi>
            
    p
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     p
    
            </mi>
    
            <mi>
             
     u
    
            </mi>
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     p
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     p
    
            </mi>
    
            <mi>
             
     u
    
            </mi>
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     p
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> in free bucking when Equation (11) is maximized for independent sawmills (‘Independent SM, free’) and Equation (12) is maximized for sawmills with pulp (‘SM with pulp, free’). Real stumpage price 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    p
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     g
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     g
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <mo>
           
   +
  
          </mo>
  
          <msub> 
   
           <mi>
            
    p
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     p
    
            </mi>
    
            <mi>
             
     u
    
            </mi>
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     p
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     p
    
            </mi>
    
            <mi>
             
     u
    
            </mi>
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     p
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> in assortment pricing after maximizing Equation (13) for independent sawmills (‘Indep. SM, as.’) and after maximizing Equation (14) for sawmills with pulp (‘SM with pulp’) with respect 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    P
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     h
    
            </mi>
    
            <mi>
             
     i
    
            </mi>
    
            <mi>
             
     p
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math>. If the buyers would buck similarly as would be optimal in free bucking and would anyhow pay 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    p
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     g
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> for 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     g
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    p
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     p
    
            </mi>
    
            <mi>
             
     u
    
            </mi>
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     p
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> for 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     p
    
            </mi>
    
            <mi>
             
     u
    
            </mi>
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     p
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math>, the forest owner would get stumpage price shown with ‘free’ curves.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1621033-rId903.jpeg?20240624105422" />
     </fig>
     <fig id="fig13" position="float">
      <label>Figure 13</label>
      <caption>
       <title>
        <xref ref-type="bibr" rid="scirp.133979-"></xref>Figure 13. Dead weight loss computed using Equation (15) for independent sawmill (‘Indep. SM’) and Equation (16) for sawmill with pulp (‘SM pulp’) with respect to the price of chips 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    P
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     h
    
            </mi>
    
            <mi>
             
     i
    
            </mi>
    
            <mi>
             
     p
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math>.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1621033-rId918.jpeg?20240624105421" />
     </fig>
     <p>I do not have competence to fully understand the economic interpretation of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> in the Equations (12) and (14) for sawmills with pulp even if the bucking optimization clearly needs such term. A reason for the difficulty is that 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> can be interpreted both as a marginal utility and a control parameter for controlling the flow of chips.</p>
    </sec>
    <sec id="s5_7">
     <title>5.7. Cost of Chips</title>
     <p>Both in free bucking and in the assortment pricing, increasing 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> produces larger 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> for independent sawmills. For sawmills with pulp, increasing 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> produces larger 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            c 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. It is straightforward to analyze how much the increase of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> or of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            c 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> costs, because 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> determining the cost are quite well defined. The volumes are expressed as a function of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. The cost for independent sawmills in free pricing is (when Equation (11) is optimized):</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           c 
         </mi> 
         <mrow> 
          <mi>
            f 
          </mi> 
          <mi>
            i 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mfrac> 
         <mrow> 
          <msub> 
           <mi>
             P 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
              <mi>
                u 
              </mi> 
             </mrow> 
            </msub> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mn>
               0 
             </mn> 
             <mo>
               ) 
             </mo> 
            </mrow> 
            <mo>
              − 
            </mo> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
              <mi>
                u 
              </mi> 
             </mrow> 
            </msub> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <msub> 
               <mi>
                 P 
               </mi> 
               <mrow> 
                <mi>
                  c 
                </mi> 
                <mi>
                  h 
                </mi> 
                <mi>
                  i 
                </mi> 
                <mi>
                  p 
                </mi> 
               </mrow> 
              </msub> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              h 
            </mi> 
            <mi>
              i 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               P 
             </mi> 
             <mrow> 
              <mi>
                c 
              </mi> 
              <mi>
                h 
              </mi> 
              <mi>
                i 
              </mi> 
              <mi>
                p 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            − 
          </mo> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              h 
            </mi> 
            <mi>
              i 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mn>
             0 
           </mn> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
        </mfrac> 
       </mrow> 
      </math> (17)</p>
     <p>The cost for independent sawmills in the assortment pricing is (Equation (13)):</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           c 
         </mi> 
         <mrow> 
          <mi>
            a 
          </mi> 
          <mi>
            i 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mfrac> 
         <mrow> 
          <msub> 
           <mi>
             P 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
              <mi>
                u 
              </mi> 
             </mrow> 
            </msub> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mn>
               0 
             </mn> 
             <mo>
               ) 
             </mo> 
            </mrow> 
            <mo>
              − 
            </mo> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
              <mi>
                u 
              </mi> 
             </mrow> 
            </msub> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <msub> 
               <mi>
                 P 
               </mi> 
               <mrow> 
                <mi>
                  c 
                </mi> 
                <mi>
                  h 
                </mi> 
                <mi>
                  i 
                </mi> 
                <mi>
                  p 
                </mi> 
               </mrow> 
              </msub> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            + 
          </mo> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mrow> 
            <mi>
              l 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              g 
            </mi> 
           </mrow> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                l 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                g 
              </mi> 
             </mrow> 
            </msub> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <msub> 
               <mi>
                 P 
               </mi> 
               <mrow> 
                <mi>
                  c 
                </mi> 
                <mi>
                  h 
                </mi> 
                <mi>
                  i 
                </mi> 
                <mi>
                  p 
                </mi> 
               </mrow> 
              </msub> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
            <mo>
              − 
            </mo> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                l 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                g 
              </mi> 
             </mrow> 
            </msub> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mn>
               0 
             </mn> 
             <mo>
               ) 
             </mo> 
            </mrow> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              h 
            </mi> 
            <mi>
              i 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               P 
             </mi> 
             <mrow> 
              <mi>
                c 
              </mi> 
              <mi>
                h 
              </mi> 
              <mi>
                i 
              </mi> 
              <mi>
                p 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            − 
          </mo> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              h 
            </mi> 
            <mi>
              i 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mn>
             0 
           </mn> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
        </mfrac> 
       </mrow> 
      </math> (18)</p>
     <p>The cost for sawmill with pulp in free bucking is (Equation (12)):</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           c 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            i 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mfrac> 
         <mrow> 
          <msub> 
           <mi>
             P 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
              <mi>
                u 
              </mi> 
             </mrow> 
            </msub> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mn>
               0 
             </mn> 
             <mo>
               ) 
             </mo> 
            </mrow> 
            <mo>
              − 
            </mo> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
              <mi>
                u 
              </mi> 
             </mrow> 
            </msub> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <msub> 
               <mi>
                 P 
               </mi> 
               <mrow> 
                <mi>
                  c 
                </mi> 
                <mi>
                  h 
                </mi> 
                <mi>
                  i 
                </mi> 
                <mi>
                  p 
                </mi> 
               </mrow> 
              </msub> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mn>
             0 
           </mn> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            − 
          </mo> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               P 
             </mi> 
             <mrow> 
              <mi>
                c 
              </mi> 
              <mi>
                h 
              </mi> 
              <mi>
                i 
              </mi> 
              <mi>
                p 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
        </mfrac> 
       </mrow> 
      </math> (19)</p>
     <p>The cost for sawmill with pulp in the assortment pricing is (Equation (14):</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           c 
         </mi> 
         <mrow> 
          <mi>
            a 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mfrac> 
         <mrow> 
          <msub> 
           <mi>
             P 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
              <mi>
                u 
              </mi> 
             </mrow> 
            </msub> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mn>
               0 
             </mn> 
             <mo>
               ) 
             </mo> 
            </mrow> 
            <mo>
              − 
            </mo> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
              <mi>
                u 
              </mi> 
             </mrow> 
            </msub> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <msub> 
               <mi>
                 P 
               </mi> 
               <mrow> 
                <mi>
                  c 
                </mi> 
                <mi>
                  h 
                </mi> 
                <mi>
                  i 
                </mi> 
                <mi>
                  p 
                </mi> 
               </mrow> 
              </msub> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            − 
          </mo> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               p 
             </mi> 
             <mrow> 
              <mi>
                l 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                g 
              </mi> 
             </mrow> 
            </msub> 
            <mo>
              − 
            </mo> 
            <msub> 
             <mi>
               p 
             </mi> 
             <mrow> 
              <mi>
                p 
              </mi> 
              <mi>
                u 
              </mi> 
              <mi>
                l 
              </mi> 
              <mi>
                p 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
             </mrow> 
            </msub> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mn>
               0 
             </mn> 
             <mo>
               ) 
             </mo> 
            </mrow> 
            <mo>
              − 
            </mo> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
             </mrow> 
            </msub> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <msub> 
               <mi>
                 P 
               </mi> 
               <mrow> 
                <mi>
                  c 
                </mi> 
                <mi>
                  h 
                </mi> 
                <mi>
                  i 
                </mi> 
                <mi>
                  p 
                </mi> 
               </mrow> 
              </msub> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mn>
             0 
           </mn> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            − 
          </mo> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               P 
             </mi> 
             <mrow> 
              <mi>
                c 
              </mi> 
              <mi>
                h 
              </mi> 
              <mi>
                i 
              </mi> 
              <mi>
                p 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
        </mfrac> 
       </mrow> 
      </math> (20)</p>
     <p>Note that differences between V terms are presented in the direction producing positive values. The difference between pricing methods cannot be inferred from the 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> in the numerator because the denominator also is different.</p>
     <p>Remarks based on <xref ref-type="fig" rid="fig14">
       Figure 14
      </xref>:</p>
     <fig id="fig14" position="float">
      <label>Figure 14</label>
      <caption>
       <title>Figure 14. The left subfigure show the cost of additional chips in free bucking computed with Equations (17) and (18) based on maximization of Equations (11) and (12). The right subfigure shows the ratio of costs between assortment pricing and free bucking. The cost of assortment pricing are computed using Equations (19) and (20) based on maximization of Equations (13) and (14).</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1621033-rId966.jpeg?20240624105422" />
     </fig>
     <p>market. The total supply of chips is limited by the level of potential harvests which can be increased very slowly or not at all. If the company raises the price of chips it pays to get a bigger share of chips at the market, it should evidently pay generally the same price for all chips in the future. But increasing 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> in its own harvests makes it possible to obtain more relative expensive chips without increasing 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> for all chips bought. The company can use its harvests as a similar regulatory reserve for chips as it can use its own forests, or a power company can use waterpower. <xref ref-type="fig" rid="fig14">
       Figure 14
      </xref> and Equation (20) shows that the assortment pricing decreases the cost of additional chips: the company can make the forest owner to pay part of the cost of chips by moving chips from the expensive sawlog part into the cheap pulp wood.</p>
    </sec>
    <sec id="s5_8">
     <title>5.8. One or Two Sawlogs?</title>
     <p>It is quite easy and painful to forest owners to detect that a buyer bucks one sawlog from stems which would produce two logs. Several forest owners and some previous employees of companies claim that the situation is common in practice.</p>
     <fig id="fig15" position="float">
      <label>Figure 15</label>
      <caption>
       <title>Figure 15. Share of two-log buckings with respect to 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    P
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     h
    
            </mi>
    
            <mi>
             
     i
    
            </mi>
    
            <mi>
             
     p
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> in the data. Such stems are included where both one and two logs are possible, i.e., 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   L
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mrow> 
    
            <msub> 
     
             <mi>
               D 
             </mi> 
     
             <mrow> 
              <mi>
                min 
              </mi> 
             </mrow> 
    
            </msub> 
   
           </mrow> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
  
          <mo>
           
   =
  
          </mo>
  
          <mi>
           
   L
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mrow> 
    
            <mn>
             
     15
    
            </mn>
    
            <mtext>
      
    
            </mtext>
    
            <mtext>
             
      
    
            </mtext>
    
            <mtext>
             
     cm
    
            </mtext>
   
           </mrow> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
 
         </mrow>

        </math>

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mo>
           
   ≥
  
          </mo>
  
          <mn>
           
   2
  
          </mn>
  
          <msub> 
   
           <mi>
            
    L
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     min
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <mo>
           
   =
  
          </mo>
  
          <mn>
           
   80
  
          </mn>
  
          <mtext>
           
    
  
          </mtext>
  
          <mtext>
           
    dm
  
          </mtext>
 
         </mrow>

        </math> and making one log with maximum length 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    L
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     max
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <mo>
           
   =
  
          </mo>
  
          <mn>
           
   55
  
          </mn>
  
          <mtext>
           
    
  
          </mtext>
  
          <mtext>
           
    dm
  
          </mtext>
 
         </mrow>

        </math> does not allow one further log, i.e., 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   L
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mrow> 
    
            <mn>
             
     15
    
            </mn>
    
            <mtext>
             
      
    
            </mtext>
    
            <mtext>
             
      cm
    
            </mtext>
   
           </mrow> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
  
          <mo>
           
   &lt;
  
          </mo>
  
          <msub> 
   
           <mi>
            
    L
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     max
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <mo>
           
   +
  
          </mo>
  
          <msub> 
   
           <mi>
            
    L
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     min
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <mo>
           
   =
  
          </mo>
  
          <mn>
           
   95
  
          </mn>
  
          <mtext>
           
    
  
          </mtext>
  
          <mtext>
           
    dm
  
          </mtext>
 
         </mrow>

        </math>. The are 216 such stem out of 2046.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1621033-rId975.jpeg?20240624105423" />
     </fig>
     <p>increase when the chip price starts to increase from 50 €/m<sup>3</sup>. If the conviction of many people that sawmills with pulp usually buck one log for potential two-log stems is true, this gives evidence that the competition at chip market is not perfect.</p>
     <p>It is understandable that a forest owner blames the buyer when seeing how two-log stems produce just one log. The blame has a legal basis only if the buyer has not obeyed agreed log dimensions. Law requires joint-stock companies to behave this way if it is profitable and assortment pricing is used.</p>
    </sec>
   </sec>
   <sec id="s6">
    <title>6. Sawn Wood Potential Pricing</title>
    <sec id="s6_1">
     <title>6.1. Definition</title>
     <p>The commercial stem volume 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            m 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> was decomposed above into 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. If this decomposition is used for pricing, a price should be given to threes component. But pulp wood is also used to make chips for pulping. Longer fibers produced by sawmills are more valuable than fibers from pulp wood. Taking this into account would complicate the pricing. Chips produced by sawmills have larger market value than pulp wood which needs chipping. But we are now considering potential chips in standing trees. 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> contains bark, but so does 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>.</p>
     <p>I suggest the price:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mtable> 
        <mtr> 
         <mtd> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mrow> 
            <mi>
              p 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              t 
            </mi> 
           </mrow> 
          </msub> 
          <mo>
            = 
          </mo> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
          <msubsup> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
           <mrow> 
            <mi>
              max 
            </mi> 
           </mrow> 
          </msubsup> 
          <mo>
            + 
          </mo> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              h 
            </mi> 
            <mi>
              i 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              t 
            </mi> 
            <mi>
              c 
            </mi> 
           </mrow> 
          </msub> 
         </mtd> 
        </mtr> 
        <mtr> 
         <mtd> 
          <mo>
            = 
          </mo> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
          <msubsup> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
           <mrow> 
            <mi>
              max 
            </mi> 
           </mrow> 
          </msubsup> 
          <mo>
            + 
          </mo> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              h 
            </mi> 
            <mi>
              i 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                c 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                m 
              </mi> 
             </mrow> 
            </msub> 
            <mo>
              − 
            </mo> 
            <msubsup> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
             </mrow> 
             <mrow> 
              <mi>
                max 
              </mi> 
             </mrow> 
            </msubsup> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mtd> 
        </mtr> 
       </mtable> 
      </math> (21)</p>
     <p>where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msubsup> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msubsup> 
       </mrow> 
      </math> is the maximum value of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> among feasible schedules. 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            m 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> is obtained from the harvester measurements after a possible update with the top equations shown in <xref ref-type="fig" rid="fig16">
       Figure 16
      </xref>, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> is the unit price of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> is unit price of chips both in 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and in 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. The price can be presented:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            t 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              h 
            </mi> 
            <mi>
              i 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
          <mo>
            + 
          </mo> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               p 
             </mi> 
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
             </mrow> 
            </msub> 
            <mo>
              − 
            </mo> 
            <msub> 
             <mi>
               p 
             </mi> 
             <mrow> 
              <mi>
                c 
              </mi> 
              <mi>
                h 
              </mi> 
              <mi>
                i 
              </mi> 
              <mi>
                p 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mfrac> 
           <mrow> 
            <msubsup> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
             </mrow> 
             <mrow> 
              <mi>
                max 
              </mi> 
             </mrow> 
            </msubsup> 
           </mrow> 
           <mrow> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                c 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                m 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
          </mfrac> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            m 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> (22)</p>
     <p>Thus</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            m 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          + 
        </mo> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
          <mo>
            − 
          </mo> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              h 
            </mi> 
            <mi>
              i 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mfrac> 
         <mrow> 
          <msubsup> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
           <mrow> 
            <mi>
              max 
            </mi> 
           </mrow> 
          </msubsup> 
         </mrow> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              m 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </mfrac> 
       </mrow> 
      </math> (23)</p>
     <p>is the unit price of commercial wood. It can be computed both for trees and stands. For stands, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msubsup> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msubsup> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            m 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> are sums over all trees and they cannot be computed using stem wise values of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mrow> 
         <mrow> 
          <msubsup> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
           <mrow> 
            <mi>
              max 
            </mi> 
           </mrow> 
          </msubsup> 
         </mrow> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              m 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math>. The analysis that follows aims to justify Equation (23) as a method to calculate the total value of transaction of wood. The purpose is to define the potential volume of sawn wood in a way that captures the essential features of sawing and allows objective comparisons of biddings.</p>
     <p>I suggest that the theoretical bucking is done for healthy and undamaged segments of stems. The sawn wood potential price would depend on actual bucking only for finding these segments from the output files of the harvester. It is possible that there would be disagreements between forest owners and buyers about bucking of rotten parts of stems, but these disagreements can be discussed with concrete concepts as the fundamental conflict in the assortment pricing is above rational argumentation.</p>
     <p>A buyer needs to evaluate the value of a potential stand considering species composition, logging cost, transportation cost to the mill, branches, sizes of trees and harvest time limitations when setting 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. I think that it is important that the price is given to the volume of potential sawn wood and not to value-weighted sawn wood 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. This way the amount and value are kept separate. In the trade of raw oil different prices are given to Brent and WTI qualities but amounts are measured similarly. Buyers need well-defined criteria for classifying stands according to their value <xref ref-type="bibr" rid="scirp.133979-14">
       (Malinen et al., 2015)
      </xref>. It is not important for the buyer that it gets a specific stand, it is important that it gets enough stands meeting general requirements. Thus, it should plan a strategy for setting 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> so that it gets enough stands with minimum total stumpage price and trading costs.</p>
     <p>A forest owner needs only to predict 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mrow> 
         <mrow> 
          <msubsup> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
           <mrow> 
            <mi>
              max 
            </mi> 
           </mrow> 
          </msubsup> 
         </mrow> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              m 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math> using stand totals of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msubsup> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msubsup> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            m 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> to compare different biddings using Equation (23). The prediction of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mrow> 
         <mrow> 
          <msubsup> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
           <mrow> 
            <mi>
              max 
            </mi> 
           </mrow> 
          </msubsup> 
         </mrow> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              m 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math> is discussed shortly. I claim that the sawn wood potential pricing fulfills the requirements of the market economy. The method is simple, concrete,</p>
     <fig id="fig16" position="float">
      <label>Figure 16</label>
      <caption>
       <title>
        <xref ref-type="bibr" rid="scirp.133979-"></xref>Figure 16. In left figure, colored curves connect averages of 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   V
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mrow> 
    
            <mn>
             
     4
    
            </mn>
    
            <mo>
             
     ,
    
            </mo>
    
            <mi>
             
     D
    
            </mi>
   
           </mrow> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
 
         </mrow>

        </math> from 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   L
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mn>
            
    4
   
           </mn> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
 
         </mrow>

        </math> to 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   L
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mi>
            
    D
   
           </mi> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
 
         </mrow>

        </math> when the x-axis is increased in 1 cm steps. Almost invisible black curves show the estimated curves 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   a
  
          </mi>
  
          <msup> 
   
           <mi>
            
    e
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     b
    
            </mi>
    
            <mrow>
     
             <mo>
               ( 
             </mo> 
     
             <mrow> 
              <mi>
                D 
              </mi> 
              <mo>
                − 
              </mo> 
              <mn>
                4 
              </mn> 
             </mrow> 
     
             <mo>
               ) 
             </mo>
    
            </mrow>
   
           </mrow> 
  
          </msup> 
 
         </mrow>

        </math> Only such trees are included for which 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <mi>
           
   L
  
          </mi>
  
          <mrow>
   
           <mo>
            
    (
   
           </mo> 
   
           <mrow> 
    
            <mn>
             
     15
    
            </mn>
    
            <mtext>
             
      
    
            </mtext>
    
            <mtext>
             
      cm
    
            </mtext>
   
           </mrow> 
   
           <mo>
            
    )
   
           </mo>
  
          </mrow>
  
          <mo>
           
   ≥
  
          </mo>
  
          <mn>
           
   26
  
          </mn>
  
          <mtext>
           
    dm
  
          </mtext>
 
         </mrow>

        </math> to quarantine that the tops included are not influenced by the butt swelling. On the right, the same mean curve for pine as the left figure augmented with error bars showing the standard deviation (cyan error bars) and the standard deviation of the between-stand effect 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
          
  u
 
         </mi>

        </math> in a simple variance component model 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    y
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     i
    
            </mi>
    
            <mi>
             
     j
    
            </mi>
   
           </mrow> 
  
          </msub> 
  
          <mo>
           
   =
  
          </mo>
  
          <mi>
           
   μ
  
          </mi>
  
          <mo>
           
   +
  
          </mo>
  
          <msub> 
   
           <mi>
            
    u
   
           </mi> 
   
           <mi>
            
    i
   
           </mi> 
  
          </msub> 
  
          <mo>
           
   +
  
          </mo>
  
          <msub> 
   
           <mi>
            
    e
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     i
    
            </mi>
    
            <mi>
             
     j
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> for tree 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
          
  j
 
         </mi>

        </math> in stand 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
          
  i
 
         </mi>

        </math> (blue error bars).</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1621033-rId1043.jpeg?20240624105424" />
     </fig>
     <p>transparent, less risky to both forest owners and buyers, decreases trading costs, accounts for tree size and tapering and is easy to compute. For each schedule, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> can be computed in liters using function 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          f 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           D 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> defined in Equation (5) and expressing lengths in decimeters and diameters in centimeters as follows:</p>
     <p>loglenc=0 ! cumulative length</p>
     <p>Vsaw=0</p>
     <p>do i=1,nlog ! nlog = number of sawlogs</p>
     <p>loglenc=loglenc+loglen(i) ! loglen is the log length</p>
     <p>Vsaw=Vsaw+f(D(loglenc))*D(loglenc)*D(loglenc)*loglen(i)</p>
     <p>end do</p>
     <p>Vsaw=π/400*Vsaw</p>
     <p>I have included pieces of code here and for the bucking schedules earlier to show that the price, and also the results in this analysis, are easy to compute. The sawn wood potential takes sawlog lengths into account only through 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           L 
         </mi> 
         <mrow> 
          <mi>
            min 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           L 
         </mi> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>, where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           L 
         </mi> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> is not important. There is no clear pattern how the price of sawing products depends on the length. In the domestic market, the same price per meter is generally used. Different log lengths around the lengths producing 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msubsup> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msubsup> 
       </mrow> 
      </math> provide about the same 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. So different sawmills with different lengths of sold sawn products can get amount of sawn wood closely related to 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msubsup> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msubsup> 
       </mrow> 
      </math> and well predicted from it. Log lengths do not give any clear leverage to forest owners in the pricing.</p>
     <p>There are several alternative ways to define the reference bucking which would in practice be about equally good in making biddings comparable. I think that it sounds nice to forest owners that the reference bucking is based on the maximum amount of sawn wood. Buyers should not be worried as they can freely set 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> even if they cannot set 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msubsup> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msubsup> 
       </mrow> 
      </math> as they can set 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> in the assortment pricing.</p>
     <p>Relation of sawn wood pricing to market economy and assortment pricing are discussed in final remarks section.</p>
    </sec>
    <sec id="s6_2">
     <title>6.2. Potential Pulp Wood above the Last Pulp Log</title>
     <p>If the agreed minimum top diameter 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           d 
         </mi> 
         <mrow> 
          <mi>
            min 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> is smaller than the top diameter 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           d 
         </mi> 
         <mi>
           m 
         </mi> 
        </msub> 
       </mrow> 
      </math> the harvester produces, the theoretical pulp wood should be computed using a model. Reliable models can be made for the volume between diameters 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           d 
         </mi> 
         <mi>
           m 
         </mi> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           d 
         </mi> 
         <mrow> 
          <mi>
            min 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>, i.e., 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          V 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mrow> 
            <mi>
              min 
            </mi> 
           </mrow> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mi>
             m 
           </mi> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math>. In <xref ref-type="fig" rid="fig16">
       Figure 16
      </xref> (left), the black curves describing the theoretical curves are almost invisible under the empirical curves drawn in colors. This is partly an artefact, as the tops are interpolated making the curves more regular than are the true ones. In the used data set, it was possible to derive better predictions using 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          V 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mi>
             m 
           </mi> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mi>
             m 
           </mi> 
          </msub> 
          <mo>
            + 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> as a predictor. But harvester data have irregular variation when diameters are close to 4 cm, i.e., when the harvester grip does not have a firm hold of the stem. Thus, such models are not reliable in harvester stem vectors. <xref ref-type="fig" rid="fig16">
       Figure 16
      </xref> (right) shows the means, standard deviations and standard deviations of stand effects in a variance component model when volumes of segments of pine tops were computed at one-centimeter diameter steps starting from 4 cm. Pulp wood volume from 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           d 
         </mi> 
         <mi>
           m 
         </mi> 
        </msub> 
       </mrow> 
      </math> to 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           d 
         </mi> 
         <mrow> 
          <mi>
            min 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> can be computed as 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          V 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            4 
          </mn> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mi>
             m 
           </mi> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          − 
        </mo> 
        <mi>
          V 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            4 
          </mn> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             d 
           </mi> 
           <mrow> 
            <mi>
              min 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math>. I call this later as ‘top correction’.</p>
     <p>Volume between the stump and 13 dm, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          V 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            0 
          </mn> 
          <mo>
            , 
          </mo> 
          <mn>
            13 
          </mn> 
          <mtext>
              
          </mtext> 
          <mtext>
            dm 
          </mtext> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> is predicted in Finland with models (<xref ref-type="bibr" rid="scirp.133979-#inbox/_blank">
       https://jukuri.luke.fi/handle/10024/554823
      </xref> based on legislation in <xref ref-type="bibr" rid="scirp.133979-http://www.finlex.fi/fi/viranomaiset/normi/410001/">
       http://www.finlex.fi/fi/viranomaiset/normi/410001/
      </xref>) because harvesters do not provide real measurements close to stump. Smaller grips produce measurements closer to the stump, but it would be too complicate to utilize this. The prediction errors of these model have importance magnitudes larger than errors of the top equations. Prediction errors of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          V 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            0 
          </mn> 
          <mo>
            , 
          </mo> 
          <mn>
            13 
          </mn> 
          <mtext>
              
          </mtext> 
          <mtext>
            dm 
          </mtext> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> have smaller effect in sawn wood potential pricing than in assortment pricing as in the sawn wood potential pricing errors affect the cheaper chip part and in the assortment pricing expensive sawlog part.</p>
    </sec>
    <sec id="s6_3">
     <title>6.3. Bucking Parameters</title>
     <p>A possible criterion to determine the bucking parameters would that they would produce similar 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mrow> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              l 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              g 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              m 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math> as the assortment pricing. Those who have access to stem vectors with known bucking results, can use Jlp22 to compute 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> for different parameter sets in the sawn wood potential pricing.</p>
     <p>The sawn wood potential pricing makes objective comparison straightforward if different buyers apply the same bucking parameters. As the prices would be under the full control of buyers, no one should have any reason to get the parameters to any specific values. Sawmills sawing small top diameters can show their competitiveness in stands with small trees by increasing 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> as they get sawn wood from that part of stems which is in the reference bucking put to chips part.</p>
     <p>Cooperation in the selection of bucking parameters of sawn wood potential pricing would correspond to standardization cooperation of technology industry. The competition authority should not have anything against it. Companies are afraid of accusations of illegal cooperation. Fear of accusations can also be a pretext to avoid market economy in the pricing. Cooperation in bucking parameters could be made openly in front of competition authority, ministry, forest owners and media. A company could start to offer this pricing among other pricing methods. If others would follow, the bucking parameters would evidently reach fixed values. As the new pricing system would need the acceptance of forest owners, their views should be listened, even if the old-time general agreements are no more be possible.</p>
    </sec>
    <sec id="s6_4">
     <title>6.4. Setting Prices for Sawn Wood and Chips</title>
     <p>In the assortment pricing, the pulp price 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> is the price the buyer pays for chips in the pulp wood. The basic idea in the sawn wood potential pricing is that chips in sawlogs have about the same value as chips in the pulp wood. Thus, a good starting value for 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> is current 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. As current 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> may not result from perfect competition, improvement of competition gives pressure to increase 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. Sawmills use approximately 2.05 - 2.2 m<sup>3</sup> 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> for making one m<sup>3</sup> of sawn wood which does not contain saw dust contained in 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. The saw dust is approximately 10% of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. Thus 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mrow> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              l 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              g 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                s 
              </mi> 
              <mi>
                a 
              </mi> 
              <mi>
                w 
              </mi> 
             </mrow> 
            </msub> 
            <mo>
              − 
            </mo> 
            <mn>
              0.1 
            </mn> 
            <msub> 
             <mi>
               V 
             </mi> 
             <mrow> 
              <mi>
                l 
              </mi> 
              <mi>
                o 
              </mi> 
              <mi>
                g 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mn>
          2.05 
        </mn> 
        <mo>
          ⋯ 
        </mo> 
        <mn>
          2.2 
        </mn> 
       </mrow> 
      </math>, i.e., 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mn>
          0.55 
        </mn> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          ≤ 
        </mo> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          ≤ 
        </mo> 
        <mn>
          0.59 
        </mn> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. If the reference bucking produces similar 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> as the assortment pricing, it holds that 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mn>
          1.7 
        </mn> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          ≤ 
        </mo> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          ≤ 
        </mo> 
        <mn>
          1.8 
        </mn> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi mathvariant="normal">
            l 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. For the default 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mn>
          75 
        </mn> 
        <mtext>
            
        </mtext> 
        <mrow> 
         <mi>
           € 
         </mi> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msup> 
           <mtext>
             m 
           </mtext> 
           <mtext>
             3 
           </mtext> 
          </msup> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math><sup> </sup>this would mean 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mn>
          127.5 
        </mn> 
        <mtext>
            
        </mtext> 
        <mrow> 
         <mi>
           € 
         </mi> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msup> 
           <mtext>
             m 
           </mtext> 
           <mtext>
             3 
           </mtext> 
          </msup> 
         </mrow> 
        </mrow> 
        <mo>
          ≤ 
        </mo> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          ≤ 
        </mo> 
        <mn>
          135 
        </mn> 
        <mtext>
            
        </mtext> 
        <mrow> 
         <mi>
           € 
         </mi> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msup> 
           <mtext>
             m 
           </mtext> 
           <mtext>
             3 
           </mtext> 
          </msup> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math>.</p>
     <p>The buyers need to relate new prices 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> to the properties of stands. Assume that a company has stem vectors of stands which it has harvested recently. For each stand it can compute 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msubsup> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msubsup> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            m 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. Let y denote the stumpage price of a stand, and let 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
      </math> be two examples of predictors for 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>, and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           z 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           z 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
      </math> two possible predictors for 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. Then, ignoring the error terms:</p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          y 
        </mi> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
        <msubsup> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msubsup> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            c 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math></p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
      </math></p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           b 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <msub> 
         <mi>
           z 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           b 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <msub> 
         <mi>
           z 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
      </math></p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          y 
        </mi> 
        <mo>
          = 
        </mo> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             a 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <msub> 
           <mi>
             x 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <mo>
            + 
          </mo> 
          <msub> 
           <mi>
             a 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <msub> 
           <mi>
             x 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <msubsup> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msubsup> 
        <mo>
          + 
        </mo> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             b 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <msub> 
           <mi>
             z 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <mo>
            + 
          </mo> 
          <msub> 
           <mi>
             b 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <msub> 
           <mi>
             z 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            t 
          </mi> 
          <mi>
            c 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math></p>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          y 
        </mi> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             x 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <msubsup> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
           <mrow> 
            <mi>
              max 
            </mi> 
           </mrow> 
          </msubsup> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             x 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           b 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             z 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              t 
            </mi> 
            <mi>
              c 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           b 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             z 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              t 
            </mi> 
            <mi>
              c 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math></p>
     <p>Regression parameters 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
      </math> etc. can be estimated with linear regression using 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <msubsup> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msubsup> 
       </mrow> 
      </math> etc. as the predictors. The procedure is similar as used in mixed models when random class parameters are predicted with class level variables <xref ref-type="bibr" rid="scirp.133979-16">
       (Mehtätalo &amp; Lappi, 2020)
      </xref>. Statistically determined parameters for expressing 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> as a function of stand properties is needed only initially when moving smoothly to the new pricing. Thereafter the parameters of functions would be decision variables. When such regression equations are computed there is no need to dig how aggressively the companies have utilized the loopholes of assortment pricing. For winning current biddings 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mrow> 
         <mrow> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              h 
            </mi> 
            <mi>
              i 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math> is not important, only the total stumpage price needs to be competitive. But for sending information to the future supply of timber, buyers should tell what they really want.</p>
     <p>A company offering stem pricing cannot claim that it would be too difficult to set 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. The stem pricing is a special case of sawn wood pricing setting that 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>.</p>
     <p>After a smooth transition to sawn wood pricing, Adam Smith’s invisible hand can take control of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>.</p>
    </sec>
    <sec id="s6_5">
     <title>6.5. Estimation of Sawn Wood Percentage</title>
     <p>In the sawn wood potential pricing, an estimate for 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mrow> 
         <mrow> 
          <msubsup> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
           <mrow> 
            <mi>
              max 
            </mi> 
           </mrow> 
          </msubsup> 
         </mrow> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              m 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math> needs to be computed to get the unit price of commercial volume using Equation (23). If 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msubsup> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msubsup> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            m 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> have a permanent definition and do not depend on the realized bucking, it is possible to accumulate knowledge for their estimation. In the sawn wood potential pricing, the effective total stumpage price is unknown at the time deal, but it can be estimated objectively. This is at contrast to the assortment pricing where 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mrow> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              l 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              g 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              m 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math> is secret and unpredictable. <xref ref-type="fig" rid="fig17">
       Figure 17
      </xref> (left) shows how regularly 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msubsup> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msubsup> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            m 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> depend on dbh. It would be easy to estimate reliable models for these curves. The most difficult task is to estimate the diameter distribution cost-efficiently. In estimating 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msubsup> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msubsup> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            m 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> it should be considered that 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msubsup> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msubsup> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            m 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> are nonlinear with respect to dbh. Thus values of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msubsup> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msubsup> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            m 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> of curves at average dbh give biased (too large), prediction for averages of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msubsup> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msubsup> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            m 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. If in addition to mean also standard deviation is estimated, the bias can be corrected using methods presented in <xref ref-type="bibr" rid="scirp.133979-16">
       Mehtätalo and Lappi (2020)
      </xref>. The two-point distribution method is my favorite. Instead of using the arithmetic average of dbh, e.g. the basal are median dbh may be more useful. Tree wise 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mrow> 
         <mrow> 
          <msubsup> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
           <mrow> 
            <mi>
              max 
            </mi> 
           </mrow> 
          </msubsup> 
         </mrow> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              m 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math> is not useful for estimated the stand level ratio of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msubsup> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msubsup> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            m 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. In the whole data the average of tree wise 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mrow> 
         <mrow> 
          <msubsup> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
           <mrow> 
            <mi>
              max 
            </mi> 
           </mrow> 
          </msubsup> 
         </mrow> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              m 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math> was 28.8%, and total 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msubsup> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msubsup> 
       </mrow> 
      </math> was 47.5% of total 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            m 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. It is possible that reliable estimates of</p>
     <fig id="fig17" position="float">
      <label>Figure 17</label>
      <caption>
       <title>
        <xref ref-type="bibr" rid="scirp.133979-"></xref>Figure 17. Left figure shows how commercial volume 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     m
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math>, sawlog volume 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     g
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> (orange line) and sawn wood volume 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> depend on dbh when 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> is maximized. Note that 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> is in fact equal to 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msubsup> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
   
           <mrow> 
    
            <mi>
             
     max
    
            </mi>
   
           </mrow> 
  
          </msubsup> 
 
         </mrow>

        </math>. Cyan lines show the range of possible sawlog volumes. Right figure shows how 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     l
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     g
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> and 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     s
    
            </mi>
    
            <mi>
             
     a
    
            </mi>
    
            <mi>
             
     w
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math> depend on 

        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
          <msub> 
   
           <mi>
            
    V
   
           </mi> 
   
           <mrow> 
    
            <mi>
             
     c
    
            </mi>
    
            <mi>
             
     o
    
            </mi>
    
            <mi>
             
     m
    
            </mi>
   
           </mrow> 
  
          </msub> 
 
         </mrow>

        </math>. Black lines are the regression lines. When all variables were multiplied with 10, the orange and red line on the bottom right corner are obtained, the ranges of axes becoming (0, 250) instead of (0, 2500).</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1621033-rId1222.jpeg?20240624105427" />
     </fig>
     <p>
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mrow> 
         <mrow> 
          <msubsup> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
           <mrow> 
            <mi>
              max 
            </mi> 
           </mrow> 
          </msubsup> 
         </mrow> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              c 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              m 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math> can be obtained directly instead to estimate first stand wise 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msubsup> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
         <mrow> 
          <mi>
            max 
          </mi> 
         </mrow> 
        </msubsup> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            m 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>.</p>
    </sec>
   </sec>
   <sec id="s7">
    <title>7. Comparing Biddings</title>
    <p>Two biddings using sawn wood potential pricing with same bucking parameters can be compared using Equation (23) after estimating 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mrow> 
         <msubsup> 
          <mi>
            V 
          </mi> 
          <mrow> 
           <mi>
             s 
           </mi> 
           <mi>
             a 
           </mi> 
           <mi>
             w 
           </mi> 
          </mrow> 
          <mrow> 
           <mi>
             max 
           </mi> 
          </mrow> 
         </msubsup> 
        </mrow> 
        <mo>
          / 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            V 
          </mi> 
          <mrow> 
           <mi>
             c 
           </mi> 
           <mi>
             o 
           </mi> 
           <mi>
             m 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
       </mrow> 
      </mrow> 
     </math> either directly or estimating first 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          V 
        </mi> 
        <mrow> 
         <mi>
           s 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           w 
         </mi> 
        </mrow> 
        <mrow> 
         <mi>
           max 
         </mi> 
        </mrow> 
       </msubsup> 
      </mrow> 
     </math> and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          V 
        </mi> 
        <mrow> 
         <mi>
           c 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           m 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math>. Two biddings with different bucking parameters can be compared using Equation (8) (or its tuned version) to make values of 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mrow> 
         <msubsup> 
          <mi>
            V 
          </mi> 
          <mrow> 
           <mi>
             s 
           </mi> 
           <mi>
             a 
           </mi> 
           <mi>
             w 
           </mi> 
          </mrow> 
          <mrow> 
           <mi>
             max 
           </mi> 
          </mrow> 
         </msubsup> 
        </mrow> 
        <mo>
          / 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            V 
          </mi> 
          <mrow> 
           <mi>
             c 
           </mi> 
           <mi>
             o 
           </mi> 
           <mi>
             m 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
       </mrow> 
      </mrow> 
     </math> comparable. In stem pricing, a buyer sets the same unit price for all commercial volume obtained in the harvest. The unit price can be compared to 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          p 
        </mi> 
        <mrow> 
         <mi>
           c 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           m 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> after the top correction shown in <xref ref-type="fig" rid="fig16">
      Figure 16
     </xref>.</p>
    <p>M-Group offers size-dependent stem pricing where the unit price of commercial volume depends on the tree-level average of commercial wood. After estimating the average stem size (the buyer provides an estimate) for size-dependent stem pricing and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mrow> 
         <msubsup> 
          <mi>
            V 
          </mi> 
          <mrow> 
           <mi>
             s 
           </mi> 
           <mi>
             a 
           </mi> 
           <mi>
             w 
           </mi> 
          </mrow> 
          <mrow> 
           <mi>
             max 
           </mi> 
          </mrow> 
         </msubsup> 
        </mrow> 
        <mo>
          / 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            V 
          </mi> 
          <mrow> 
           <mi>
             c 
           </mi> 
           <mi>
             o 
           </mi> 
           <mi>
             m 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
       </mrow> 
      </mrow> 
     </math> for sawn wood pricing, a forest owner can compare the implied unit prices of commercial wood after the top correction. I discuss stem pricing later.</p>
    <p>In the assortment pricing, the unit price of commercial wood can be presented similarly as in the sawn would potential pricing as</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          p 
        </mi> 
        <mrow> 
         <mi>
           c 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           m 
         </mi> 
         <mo>
           _ 
         </mo> 
         <mi>
           a 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          p 
        </mi> 
        <mrow> 
         <mi>
           p 
         </mi> 
         <mi>
           u 
         </mi> 
         <mi>
           l 
         </mi> 
         <mi>
           p 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         + 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            p 
          </mi> 
          <mrow> 
           <mi>
             l 
           </mi> 
           <mi>
             o 
           </mi> 
           <mi>
             g 
           </mi> 
          </mrow> 
         </msub> 
         <mo>
           − 
         </mo> 
         <msub> 
          <mi>
            p 
          </mi> 
          <mrow> 
           <mi>
             p 
           </mi> 
           <mi>
             u 
           </mi> 
           <mi>
             l 
           </mi> 
           <mi>
             p 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mfrac> 
        <mrow> 
         <msub> 
          <mi>
            V 
          </mi> 
          <mrow> 
           <mi>
             l 
           </mi> 
           <mi>
             o 
           </mi> 
           <mi>
             g 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
        <mrow> 
         <msub> 
          <mi>
            V 
          </mi> 
          <mrow> 
           <mi>
             c 
           </mi> 
           <mi>
             o 
           </mi> 
           <mi>
             m 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
       </mfrac> 
      </mrow> 
     </math> (24)</p>
    <p>Because 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mrow> 
         <msub> 
          <mi>
            V 
          </mi> 
          <mrow> 
           <mi>
             l 
           </mi> 
           <mi>
             o 
           </mi> 
           <mi>
             g 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          / 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            V 
          </mi> 
          <mrow> 
           <mi>
             c 
           </mi> 
           <mi>
             o 
           </mi> 
           <mi>
             m 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
       </mrow> 
      </mrow> 
     </math> is a business secret of the buyer, the forest owner cannot compare sawn wood potential pricing objectively to Equation (24) even if the owner would know each stem precisely. Forest owners selling often timber, or forest owner associations can collect information of 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mrow> 
         <msub> 
          <mi>
            V 
          </mi> 
          <mrow> 
           <mi>
             l 
           </mi> 
           <mi>
             o 
           </mi> 
           <mi>
             g 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          / 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            V 
          </mi> 
          <mrow> 
           <mi>
             c 
           </mi> 
           <mi>
             o 
           </mi> 
           <mi>
             m 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
       </mrow> 
      </mrow> 
     </math>. But it is difficult to get consistent results because the price cycles of sawn wood and pulp and the chip needs for even flow of chips vary over time leading to irregular 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mrow> 
         <msub> 
          <mi>
            V 
          </mi> 
          <mrow> 
           <mi>
             l 
           </mi> 
           <mi>
             o 
           </mi> 
           <mi>
             g 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          / 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            V 
          </mi> 
          <mrow> 
           <mi>
             c 
           </mi> 
           <mi>
             o 
           </mi> 
           <mi>
             m 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
       </mrow> 
      </mrow> 
     </math>. Despite of these problems, a forest owner should concentrate on Equation (24) instead of paying attention to 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          p 
        </mi> 
        <mrow> 
         <mi>
           l 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           g 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          p 
        </mi> 
        <mrow> 
         <mi>
           p 
         </mi> 
         <mi>
           u 
         </mi> 
         <mi>
           l 
         </mi> 
         <mi>
           p 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math>. Sawlog price 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          p 
        </mi> 
        <mrow> 
         <mi>
           l 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           g 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> may psychologically look more important than it is, especially if high 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          p 
        </mi> 
        <mrow> 
         <mi>
           l 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           g 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> is connected to low 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          V 
        </mi> 
        <mrow> 
         <mi>
           l 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           g 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math>. If a forest owner sells timber using assortment pricing and there were biddings using stem pricing or sawn wood potential, the owner can know after the deal whether the correct selection was made.</p>
   </sec>
   <sec id="s8">
    <title>8. Discussion</title>
    <sec id="s8_1">
     <title>8.1. Interpretation of the Results</title>
     <p>Independent sawmills may consider that both in the assortment pricing and in the sawn wood potential pricing higher chip prices make longer logs more profitable (<xref ref-type="fig" rid="fig1">
       Figure 1
      </xref>1).</p>
     <p>The analysis of the assortment pricing assumed that the buyer has already bought the stand using a given 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. But buyers need to consider bucking and determination of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> simultaneously so that it wins enough biddings. This is demanding if a sawmill with pulp plans to buck using high 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> leading to reduced 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and reduced stumpage price.</p>
     <p>I made first round of computations using sawn wood volume 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> in the objectives instead of the value-weighted sawn wood volume 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. Result looked otherwise similar as above, but the drop of curves was even faster than in <xref ref-type="fig" rid="fig10">
       Figure 10
      </xref> when price of chips 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> approaches price of sawn wood 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. Optimization of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> leads to on/off behavior while optimization of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> leads to smoother increase of chips.</p>
     <p>Common view of many forest owners and experts is that sawmills with pulp produce more unpredictable and more variable bucking results than independent sawmills. <xref ref-type="fig" rid="figFigures 8-10">
       Figures 8-10
      </xref> show that the validity of this claim is dependent on the value of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> companies use in the bucking. If it would be possible to access empirical data of bucking results it might be possible to estimate 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> they use in the bucking. Then correction coefficients could then be estimated to make the saw-log prices of sawmills with pulp comparable to the sawlog prices of independent sawmills. If such correction coefficients would be published, companies owning both pulp mills and sawmills might be more willing to accept sawn wood potential pricing in the timber trade. Some forest owner associations collect such information but are of course not willing to publish it.</p>
     <p>Above analysis makes it understandable why companies have kept secret their price matrices. When looking more closely to the bucking, I was surprised how simple is the maximization of the value of sawn products in the bucking. As all sawmills operate at the same sawn wood market and harvest similar stands, the competitors may not benefit of knowing what log dimensions are made. The only real secret is the regulation of the sawlog percentage with the secret price matrix.</p>
     <p>If the companies change prices, the profit maximization requires the companies to change bucking in the assortment pricing simultaneously. I did some computations with alternative elasticities. The results might be of some interest to economists who have wondered peculiar behavior of elasticities in the lumber trade, but as they do not bring a new feature into the whole picture, I’m not showing them. This may be one reason, why estimating price elasticities for supply and demand is so difficult, and the results vary much from study to study <xref ref-type="bibr" rid="scirp.133979-5">
       (Kallio, 2001;
      </xref> <xref ref-type="bibr" rid="scirp.133979-20">
       Tian et al., 2017)
      </xref>. The assortment pricing would require economic theories for the supply and demand when prices are secret and selection of the buyer is a lottery game. If buyers change sawlog and pulp prices and bucking simultaneously, and the forest owners sell whole stems, and the forest owners cannot objectively compare effective total stumpage prices, it would be a scientific miracle, if consistent results would be obtained for elasticities. In the sawn wood potential pricing, prices are given for such quantities of which the buyers are interested. The prices are not nested as 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> is nested in 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. If the sawn wood potential pricing will be used, I anticipate more consistent elasticities.</p>
     <p>The analysis was based on stem components and their prices. A harvester bucks using a price matrix for combinations of lengths and top diameters of sawlogs and pulp wood. If 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> is used in the objective, sawlog value 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> can be directly put into the price matrix because 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> depends only on the log length and top diameter. The component 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> can be put into the price matrix by writing 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. The harvester can predict 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> using the stem curve model it uses in its bucking algorithm.</p>
     <p>Capacities of sawmills were not considered above in the analysis. We may assume that independent sawmills do not buy stands whose sawlogs it cannot saw. Sawmills with pulp need to consider both the capacity of the sawmill and the capacities of pulp mills of the company. Sawmill and pulp mill capacities affect differently. Sawmill capacity sets an upper limit for the production. A pulp mill capacity sets both upper and lower limit for the flow of timber. This emphasizes again the role of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> in the bucking. Currently companies sell and buy timber fluently from each other. Thus, a sawmill with pulp can sell sawlogs which exceed the sawing capacity, and it can send them also to pulp mills.</p>
     <p>Results above were computed using 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mn>
          75 
        </mn> 
        <mtext>
            
        </mtext> 
        <mrow> 
         <mi>
           € 
         </mi> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msup> 
           <mtext>
             m 
           </mtext> 
           <mtext>
             3 
           </mtext> 
          </msup> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mn>
          25 
        </mn> 
        <mtext>
            
        </mtext> 
        <mrow> 
         <mi>
           € 
         </mi> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msup> 
           <mtext>
             m 
           </mtext> 
           <mtext>
             3 
           </mtext> 
          </msup> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math>. Increasing 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> has the same effect as decreasing both 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. Increasing 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> has the same effect for sawmills with pulp as decreasing 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>.</p>
     <p>There are four different reasons to ‘transport valuable sawlog to pulp mill’ in the assortment pricing, i.e., to buck smaller 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> than possible. These reasons for sawmills with pulp are, starting from 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mn>
          0 
        </mn> 
       </mrow> 
      </math> (<xref ref-type="fig" rid="figFigures 4-6">
       Figures 4-6
      </xref>).</p>
     <p>Both the amount of sawn wood 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and its value 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> can be increased if their maximum is on the left from the cutting point producing maximum 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>.</p>
     <p>Moving left from the cutting point maximizing 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> decreases both 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> but increases the value of sawn wood 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> because the top diameters 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           D 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> increase.</p>
     <p>Moving left from cutting point maximizing 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> decreases 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> but decrease of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> is smaller than the benefit of moving expensive chips from the sawlog to cheap pulp wood. Dead weight loss is large (<xref ref-type="fig" rid="fig13">
       Figure 13
      </xref>).</p>
     <p>When chips are very valuable, then bucking even less 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> means that also valuable sawn wood in the sawlog is moved to valuable chips in the pulp wood 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. The forest owner gets a big loss compared to bucking maximizing 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> or 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
          <mi>
            u 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>, and comparing what an independent sawmill had paid with clearly smaller nominal sawlog price 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. Dead weight loss is, however, small (<xref ref-type="fig" rid="fig13">
       Figure 13
      </xref>).</p>
     <p>The above arguments apply directly when considering bucking of the last sawlog. With several logs the same reasoning applies in principle, even if there will be more complicated interactions.</p>
    </sec>
    <sec id="s8_2">
     <title>8.2. Stem Pricing and Other Pricing Methods</title>
     <p>
      <xref ref-type="bibr" rid="scirp.133979-4">
       Hekkala (2023)
      </xref> describes properties of stem pricing and other pricing methods. Stem pricing was already analyzed above from the viewpoint of bidding comparisons. Now its utility is discussed for the viewpoint of market economy, trading costs and optimization of silviculture. In stem pricing, the buyers need to spend more money than in the sawn wood potential pricing to study the properties of the stand to make a reasonable bidding. The forest owner cannot see how the offered price is related to the value of wood in wood processing. The pricing does not give any information for forest owners and research how to optimize future forestry or how to select the next stand to harvest.</p>
     <p>Size-dependent stem pricing gives a little information of what kind of models are behind the price. But as a confidential price is given for each forest owner and stand separately for a narrow stem size window in tabular form, no general understanding is obtained. The only table I have seen indicates that the dependency of price on the stem size consists of two linear parts having almost identical slopes. I cannot see any other reason for presenting price in tabular form instead simple function than that M-group wants to hide from supply side of timber trade the demand it has for timber.</p>
     <p>In stem section pricing the different stem sections defined with diameter ranges are given different prices. This pricing will evidently become important when sawmills start transporting whole stems into sawmills and start to saw stem sections. I do not see any utility in this pricing if sawmills sawlogs. I’m not aware of any quantitative analysis of how stem sections are related to sawn wood and chips.</p>
     <p>Matrix pricing defines a separate price for each diameter, quality, and length class. It would be impossible for the forest owner to compare price matrices of different buyers and to understand their background. Only companies use matrix pricing in selling sawlogs to other companies <xref ref-type="bibr" rid="scirp.133979-4">
       (Hekkala, 2023)
      </xref>.</p>
    </sec>
    <sec id="s8_3">
     <title>8.3. Distribution Bucking</title>
     <p>In distribution bucking trees are bucked so that the distribution of log lengths and top diameters is close to a target distribution <xref ref-type="bibr" rid="scirp.133979-7">
       (Kivinen, 2001)
      </xref>. I think that this approach looks the bucking problem from a false direction. This approach would be rational if there are more trees available than needed and it would be possible to just pick from the large population the distribution wanted. When the harvester grip moves on 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mi>
          D 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           L 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </math> in <xref ref-type="fig" rid="fig3">
       Figure 3
      </xref>, <xref ref-type="fig" rid="fig5">
       Figure 5
      </xref>, and <xref ref-type="fig" rid="fig15">
       Figure 15
      </xref>, only such dimensions can be made which are on the stem curves. A user of the distribution bucking is like a passenger of a train wanting to go to a town outside the track. There are studies of how closeness to the target distribution should be measured (e.g. <xref ref-type="bibr" rid="scirp.133979-13">
       Malinen &amp; Palander, 2004
      </xref>). If the top diameter is larger than a saw blade setting requires it can still be sawn with the same setting as a smaller top diameter cannot. One saw blade setting may allow 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           d 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>-range of 0.5 - 2 cm (Pertti Holmila and Antti Heikkilä, personal communication). In bucking the difference between 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           d 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           D 
         </mi> 
         <mrow> 
          <mi>
            t 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> needs to be considered. It is possible, even if not rational, to find bucking schedules producing a distribution close to the target using Jlp22 with a goal programming formulation <xref ref-type="bibr" rid="scirp.133979-10">
       (Lappi, 1992)
      </xref>.</p>
     <p>The target distribution of sawlog dimensions may be sufficient for providing the target distribution of sawn product dimensions. But a specific target distribution of log dimensions is never necessary. It is likely that a target distribution of logs is not feasible, but there are feasible distributions that produce desired sawn products. In the further research section, I’ll outline how linear programming can be used to get desired sawn product distribution both when there is one evident saw blade setting for each top diameter or there are several settings for some top diameters.</p>
     <p>The message of this comment is the same as the message of the sawn wood potential pricing: pay attention to sawn wood and sawn products, not to sawlogs. Researchers could better help sawmills if sawmills would describe their bucking problems in terms of blade settings and dimensions of the products instead of target distributions of logs. It is a common fallacy in human thinking to lose sight of end goals while optimizing means goals.</p>
    </sec>
    <sec id="s8_4">
     <title>8.4. Rotation</title>
     <p>Rotations implied with fixed prices 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> are longer than rotations computed assuming corresponding fixed prices 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            p 
          </mi> 
          <mi>
            u 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> because 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <mrow> 
         <mrow> 
          <msubsup> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              s 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              w 
            </mi> 
           </mrow> 
           <mrow> 
            <mi>
              max 
            </mi> 
           </mrow> 
          </msubsup> 
         </mrow> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             V 
           </mi> 
           <mrow> 
            <mi>
              l 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              g 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </mrow> 
       </mrow> 
      </math> and thus price for 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> increases when trees become larger (<xref ref-type="fig" rid="fig8">
       Figure 8
      </xref>). Fixed 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> would not consider all benefits of larger logs. So, in a genuine market economy 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> would be larger for stands having larger trees and this should be considered in rotation studies.</p>
    </sec>
    <sec id="s8_5">
     <title>8.5. Bucking Simulator for Harvesters</title>
     <p>The assortment pricing does not encourage attention to the bucking algorithm of the harvester. For the harvest contractor, the speed of harvesting is the most important thing. Buyers do not care of poor bucking because forest owners pay for it, and bucking producing small 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> may be just what they want. Forest owners might be interested, but they do not select the contractor and they do not get the stem vectors so that they or their consultants could study the bucking results.</p>
     <p>If price is independent of bucking, it would be in the interests of buyers that harvesters buck well. They cannot buck perfectly because the harvester does not know the stem above the grip. It is difficult to make empirical studies for comparing different harvesters. It would be simple to make a simulated competition between algorithms. A neutral organization would send to the competitors stem measurements decimeter after decimeter similarly as the harvester grip sends them to the computer of the harvester. The competitors should send back commands: break, slow, stop, cut, withdraw, full speed. Researchers and other firms could participate in the competition. When the results of the competition would be published, this would give incentive to harvester manufacturer to develop the bucking algorithm or buy a better one. Currently harvester manufacturers have no incentive to develop bucking algorithms.</p>
     <p>A reasonable bucking algorithm of a harvester uses a statistical model which predicts both diameters above the harvester grip and provides estimates both the standard deviations and correlations of the prediction errors. The stem curve models in <xref ref-type="bibr" rid="scirp.133979-9">
       Lappi (1986)
      </xref> and <xref ref-type="bibr" rid="scirp.133979-23">
       Varjo et al. (2006)
      </xref> provide such estimates. Underprediction of the diameter at a planned cutting height is less harmful than overprediction. Thus, sequential stochastic optimization is a decent methodological framework for the optimization <xref ref-type="bibr" rid="scirp.133979-2">
       (De Pellegrin-Llorente, 2022)
      </xref>.</p>
    </sec>
    <sec id="s8_6">
     <title>8.6. Database for Stem Vectors of Harvesters</title>
     <p>During the harvester decades, a huge amount of valuable information has been lost as researchers have not had access to the data. An evident explanation is that the companies have been afraid of showing the stem vectors to forest owners who could compare the bucking results to the bucking possibilities. If pricing is independent of bucking, the companies have no reason to hide the stem vectors. They can freely hide their bucking results.</p>
     <p>Companies owning both sawmills and pulp tell that they own the stem vectors and forest owners do not have right to access them. Independent sawmills might be more willing to give researchers access to stem vectors. If sawmills with pulp own the stem vectors, independent sawmill own evidently also, even if they may not be aware of it.</p>
     <p>I suggest that a general data base for stem vectors should be established to which harvesters could initially send, after removing the identity of the forest owner, sample stem vectors. Initially only voluntary owners of the vectors could be used. After needed legislation, this could be obligatory. Luke would be a natural organization to take care of the data base together the inventory data, but only if it provides free access to data. If such data had been collected from the beginning of harvester epoch, good thinning models could now be estimated from stands harvested for a second or third time. Benefits of harvester data are discussed by <xref ref-type="bibr" rid="scirp.133979-6">
       Kemmerer and Labelle (2021)
      </xref>.</p>
     <p>Finnish researchers of medicine have had the advantage that they have better access to medical data bases than researchers in most countries. They have had better access to syphilis data of people than forest scientists have had to stem vectors. I was not able to access harvester data for this paper. With harvester data from several stands, I could have studied the between-stand variation of the studied variables.</p>
    </sec>
    <sec id="s8_7">
     <title>8.7. Further Research</title>
     <p>If a sawmill has estimated the diameter distribution for a stand to be harvested and can predict the stem curve for each dbh, or there are data from a similar stand, Jlp22 can be used to generate such price matrix that desired amounts of sawn wood products or chips are obtained. First, stemopt function is asked to write all bucking schedules for each dbh to disk. Then such linear programming problem can be described with problem function which produces desired amounts of products. Then, jlp function can be used to solve the problem.</p>
     <p>There are two different ways to formulate the problem. If for each top diameter of log there is only one evident saw blade setting, each log-length and top diameter combination is augmented in the bucking schedule data with the amounts of product. Then the LP problem and data have the same mathematical structure as the traditional forest management planning problems for which the linear programming algorithm of Jlp22 is designed. Trees having a given dbh correspond to a stand in management planning problem. The problem formulation is easy and the solution time short. When the problem is formulated using dummy variables for sawlog length and top diameter combinations, the shadow prices of the solution give the desired prices for log length, top diameter combinations.</p>
     <p>When the shadow prices are solved using a predicted diameter distribution, it may become apparent during the harvest that desired sawn wood dimensions will not be obtained. Then the shadow prices need to be updated either resolving the LP problem with the updated diameter distribution or using the heuristic updating of Dtran algorithm (see <xref ref-type="bibr" rid="scirp.133979-2">
       De Pellegrin-Llorente, 2022
      </xref>). When moving to forest level, the study of <xref ref-type="bibr" rid="scirp.133979-12">
       Laroze (1999)
      </xref> should be consulted.</p>
     <p>If several blade settings are allowed for some top diameters, the problem has the same structure as planning problem where timber is transported to factories <xref ref-type="bibr" rid="scirp.133979-11">
       (Lappi &amp; Lempinen, 2014)
      </xref>. A blade setting is then a ‘factory’ to which logs are transported. A simpler and more efficient algorithm for factory optimization is under implementation to Jlp22. I would try to prove my criticism of distribution bucking in section 8.3 if I could access harvester data.</p>
     <p>A sawmill can optimize blade settings with Jlp22 when the sawlog storage, blade settings and sawn wood sales and/or sawn product prices are given. This problem has also the same mathematical structure as the traditional management planning problems. The problem formulation requires that the log storage, blade settings and product sales data sets are linked to each other in a convenient way. New tools for that will be published soon. The method can be developed and published without real data.</p>
     <p>I try to finalize my study for the prediction of stem curves above the harvester grip and for implied stochastic optimization of bucking. I do not mind if someone makes it first.</p>
    </sec>
    <sec id="s8_8">
     <title>8.8. Final Remarks</title>
     <p>The dead weight loss is not the most important damage to the society what the assortment pricing does. More important costs of the assortment pricing are:</p>
     <p>Historians may explain why assortment pricing has lasted decades after harvesters made it irrational from the viewpoint of market economy. An evident explanation is path dependency. Another explanation is that market economy is not beneficial, at least in short run, to all partners of timber trade. Specifically, it is beneficial to sawmills with pulp that forest owners cannot objectively compare biddings. They can win biddings with high sawlog price and decrease stumpage price with small 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>. It is beneficial to them also that they can keep oligopoly and pay different price for chips they obtain from independent sawmills than they use in their own buckings. Timber trade is a triangle drama between forest owners, independent sawmills and companies owning both sawmills and pulp mills. Even if many people see the problems in the assortment pricing, people are reluctant to shake the system which is obtained a balance of fear.</p>
     <p>Economic growth has always been linked to the growth of trade. The growth of trade has been always linked to more strict regulation of the rules of trade: buyers must be able to trust that they will get what they have bought without seeing the commodity, and sellers must be able to trust that they will get money for what they have sold. An essential part of the regulation are the rules how quantities are measured. In timber harvest, there are in Finland strict rules for the calibration of the harvester measurements and for the estimation of the stem volume up to 13 dm.</p>
     <p>In 1740 in Sweden grain was sold in kappas, but kappas of different sellers had different sizes. Most clever sellers had secret double bottoms. In 1743, king Frederick I legislated legal dimensions of kappas and their inspection and stamping. In the assortment pricing, the situation is like in the grain trade before the 1743 law: different buyers measure different sawlog volumes from the same stems. King Frederick I understood better in 1743, decades before Adam Smith’s Wealth of Nations (1776), the requirements of fair trade than forestry sector of Finland A.D 2024.</p>
     <p>For the sawmills with pulp, the most critical question in the comparison of pricing methods is the role of 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> in their bucking algorithm, and generally in their chip strategy. If it is essential to prevent perfect competition at chip market and to have possibility to buck small log volumes for selected forest owners, they may be reluctant to accept the market economy.</p>
     <p>Stem pricing has opened the road to market pricing. Sawn wood potential pricing develops stem pricing further. As Equation (23) provides just one unit price for the total commercial volume in a stand, buyers using stem pricing can define infinite number of equivalent biddings in the sawn wood potential pricing. But if the buyers do not tell their true 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> and 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math>, the prices would not give information for the optimization of future supply.</p>
     <p>The popularity of stem pricing is increasing. If timber trade goes from assortment pricing to stem pricing, and then later from stem pricing to sawn wood potential pricing, this would be an example of Hegel’s dialectic development from thesis to antithesis, and from antithesis to synthesis.</p>
     <p>If forest owners could get access to the stem vectors it would be easy to compute with Jlp22 what kind of bucking results had been possible among agreed log dimensions. It would also be possible to estimate what 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           P 
         </mi> 
         <mrow> 
          <mi>
            c 
          </mi> 
          <mi>
            h 
          </mi> 
          <mi>
            i 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> has used in the bucking. With sufficient data it might be possible to estimate correction coefficients for nominal prices. Some forest owner associations already collect statistics of sawlog percentages of different buyers, but they do not publish them. I’m convinced that if forest owners could access stem vectors, they would not tolerate the assortment pricing very long.</p>
     <p>EU has much legislation to protect consumers, buyers. For instance, Consumer Protection from Unfair Trading Regulations, 2008 ‘Prohibit traders across all sectors from using unfair commercial practices that hinder consumers from making informed purchasing’. In timber trade, sellers should be protected from practices that hinder them making informed sales. <xref ref-type="bibr" rid="scirp.133979-1">
       Brignull (2023)
      </xref> analyzes tricks companies use to deceive consumers. Finnish politicians claim that EU interferes too much in the forestry matters of Finland. The fact that Finland has been stuck for decades to the corruptive assortment pricing conflicting with market economy and principles of fair-trade shows that Finland cannot take care of the timber trade in a rational way without the overseeing of EU. Finland may understand better its forest than EU bureaucrats.</p>
     <p>Forest owners are used to assortment pricing as their fathers and grandfathers were. An evident doubt to the sawn wood potential pricing is that forest owners could not understand it. According to my experience forest owners can understand many basic things better than the forest experts. I’m sure that forest owners would understand sawn wood pricing when seeing <xref ref-type="fig" rid="figFigures 1-4">
       Figures 1-4
      </xref> with proper explanations. Toivo Hyvärinen, forest owner who won at the court of appeal a bucking dispute in assortment pricing with UPM, understood well my pricing suggestion and thought that with such pricing similar disputes would not rise (personal communication).</p>
     <p>A problem in any pricing is that most forest owners expect to get at least the average price. This is one reason why buyers pay under the table for valuable stands to get smaller prices into the official price statistics. As the sawn wood potential pricing takes automatically into account a significant part of the increased value of larger trees, 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            s 
          </mi> 
          <mi>
            a 
          </mi> 
          <mi>
            w 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> would vary less than effective 
      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mi>
            o 
          </mi> 
          <mi>
            g 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
      </math> in the assortment pricing. If the companies would openly tell what criteria they are using in the determination of the price, it would be easier to a forest owner to believe she/he is not treated unfairly if she/he gets less than a neighbor.</p>
     <p>Sawn wood potential pricing would give a solid base for long term development of forestry and forest industries. Forest sector faces big challenges due to the climate change, environmental requirements, and EU regulations. If the absurd conflict of interest between forest owners and forest industry in the assortment pricing will be removed, forest sector could more united face the future challenges.</p>
     <p>Following suggestions are based partly on my personal views of fair play, partly on the above analysis. They are not value-free.</p>
    </sec>
   </sec>
   <sec id="s9">
    <title>Acknowledgements</title>
    <p>Heikki Smolander raised my interest in the topic criticizing for years assortment pricing saying that if similar pricing would be used for slaughtered animals, the farmer would get different prices for meat pieces cut to round or mince, and special foreseers would control in slaughterhouses that a piece which could be used for round is not used for mince. Tommy Lindström, chief executive of 100-year-old Iisveden Metsä sawmill gave valuable information for this paper and for my forthcoming book from the perspective of independent sawmills. Antti Heikkilä provided <xref ref-type="fig" rid="fig1">
      Figure 1
     </xref> and data for <xref ref-type="fig" rid="fig2">
      Figure 2
     </xref>. He and Pertti Holmila taught me many aspects of sawing. Erno Vesterinen, a local sawn wood seller from Rakennuspari, told how domestic sawn wood trade works. Toivo Hyvärinen, forest owner who won a bucking dispute with UPM told his experiences of sawmills with pulp, and he proved that forest owners may easily understand my pricing suggestion. Jari Kuuluvainen made useful suggestions for an earlier version of the paper. I had useful discussions of my paper with Lauri Mehtätalo and Reetta Lempinen from Luke, Erno Järvinen from the ministry of agriculture and forestry, Mikko Tiirola and Pauli Rintala from The Central Union of Agricultural Producers and Forest Owners (MTK), Paula Horne from Pellervo Economic Research, Anu Islander from Forest Industries and Eeva Korpilahti. Pekka Kauppi suggested to make a paper in English instead of a discussion paper in Finnish. Risto Päivinen suggested to change the title to more appealing. Reetta Lempinen allowed me to see timber trade biddings she has obtained.</p>
   </sec>
  </sec>
 </body><back>
  <ref-list>
   <title>References</title>
   <ref id="scirp.133979-ref1">
    <label>1</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Brignull, H. (2023). Deceptive Patters. Testimonium Ltd.
    </mixed-citation>
   </ref>
   <ref id="scirp.133979-ref2">
    <label>2</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     De Pellegrin-Llorente, I., Hoganson, H. M.,&amp;Windmuller-Campione, M. A. (2022). Recognizing Uncertainty in Forest Planning: A Decomposition Model for Large Landscapes. Forest Science, 68, 200-211. &gt;https://doi.org/10.1093/forsci/fxab061
    </mixed-citation>
   </ref>
   <ref id="scirp.133979-ref3">
    <label>3</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Grondin, F. (1998). Improvements of the Dynamic Programming Algorithm for Tree Bucking. Wood and Fiber Science, 30, 91-104.
    </mixed-citation>
   </ref>
   <ref id="scirp.133979-ref4">
    <label>4</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Hekkala, J. (2023). Methods of Timber Pricing from the Perspective of the Company and the Timber Seller (in Finnish, English abstract). Master’s Thesis, University of Eastern Finland Faculty of Science and Forestry, School of Forest Sciences.&gt;http://urn.fi/urn:nbn:fi:uef-20230785 
    </mixed-citation>
   </ref>
   <ref id="scirp.133979-ref5">
    <label>5</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kallio, M. (2001) Interdependence of the Sawlog, Pulpwood and Sawmill Chip Markets: An Oligopsony Model with an Application to Finland. Silva Fennica, 35, Article ID: 598. &gt;https://doi.org/10.14214/sf.598
    </mixed-citation>
   </ref>
   <ref id="scirp.133979-ref6">
    <label>6</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kemmerer, J.,&amp;Labelle E. R. (2021). Using Harvester Data from On-Board Computers: A Review of Key Findings, Opportunities and Challenges. European Journal of Forest Research, 140, 1-17. &gt;https://doi.org/10.1007/s10342-020-01313-4
    </mixed-citation>
   </ref>
   <ref id="scirp.133979-ref7">
    <label>7</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kivinen, V. P. (2001). A Genetic Algorithm Approach to Tree Bucking Optimization. Forest Science, 50, 696-710. &gt;https://doi.org/10.1093/forestscience/50.5.696
    </mixed-citation>
   </ref>
   <ref id="scirp.133979-ref8">
    <label>8</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Laasasenaho, J. (1982). Taper Curve and Volume Functions for Pine, Spruce and Birch. Communicationes Instituti Forestalis Fenniae.
    </mixed-citation>
   </ref>
   <ref id="scirp.133979-ref9">
    <label>9</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Lappi, J. (1986). Mixed Linear Models for Analyzing and Predicting Stem form Variation of Scots Pine. Communicationes Instituti Forestalis Fenniae.
    </mixed-citation>
   </ref>
   <ref id="scirp.133979-ref10">
    <label>10</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Lappi, J. (1992). JLP a Linear Programming Package for Management Planning. Finnish Forest Research Institute. 
    </mixed-citation>
   </ref>
   <ref id="scirp.133979-ref11">
    <label>11</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Lappi, J.,&amp;Lempinen, R. (2014). A Linear Programming Algorithm and Software for Forest-Level Planning Problems Including Factories. Scandinavian Journal of Forest Research, 29, 178-184. &gt;https://doi.org/10.1080/02827581.2014.886714
    </mixed-citation>
   </ref>
   <ref id="scirp.133979-ref12">
    <label>12</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Laroze, A. (1999). A Linear Programming, Tabu Search Method for Solving Forest-Level Bucking Optimization Problems. Forest Science, 45, 108-116. &gt;https://doi.org/10.1093/forestscience/45.1.108
    </mixed-citation>
   </ref>
   <ref id="scirp.133979-ref13">
    <label>13</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Malinen, J.,&amp;Palander, T. (2004). Metrics for Distribution Similarity Applied to the Bucking to Demand Procedure. International Journal of Forest Engineering, 15, 33-40. &gt;https://doi.org/10.1080/14942119.2004.10702487
    </mixed-citation>
   </ref>
   <ref id="scirp.133979-ref14">
    <label>14</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Malinen, J., Haring, M., Kilpeläinen, H.,&amp;Verkasalo, E. (2015). Comparison of Alternative Roundwood Pricing Systems—A Simulation Approach. Silva Fennica, 49, Article ID: 1293. &gt;https://doi.org/10.14214/sf.1293
    </mixed-citation>
   </ref>
   <ref id="scirp.133979-ref15">
    <label>15</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Malinen, J., Kilpeläinen, H., Wall, T.,&amp;Verkasalo, E. (2010). Roundwood Pricing Mechanisms and Their Performance in Scots Pine Roundwood Market. Working Papers of the Finnish Forest Research Institute 174. &gt;https://jukuri.luke.fi/handle/10024/536083 
    </mixed-citation>
   </ref>
   <ref id="scirp.133979-ref16">
    <label>16</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Mehtätalo, L.,&amp;Lappi, J. (2020). Biometry for Forestry and Environmental Data with Examples in R. Chapman and Hall/CRC. &gt;https://doi.org/10.1201/9780429173462
    </mixed-citation>
   </ref>
   <ref id="scirp.133979-ref17">
    <label>17</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Näsberg, M. (1985). Mathematical Programming Models for Optimal Log Bucking. Linköping Studies in Science and Technology. 
    </mixed-citation>
   </ref>
   <ref id="scirp.133979-ref18">
    <label>18</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Räsänen, T., Usenius, A., Heikkilä, A., Holmila, P.,&amp;Usenius, T. (2017). Tukkiröngtendata sahapuun ohjauksessa. Metsätehon Raportti 243.
    </mixed-citation>
   </ref>
   <ref id="scirp.133979-ref19">
    <label>19</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Ratkowsky, D. A. (1990). Handbook of Nonlinear Regression. Marcel Decker.
    </mixed-citation>
   </ref>
   <ref id="scirp.133979-ref20">
    <label>20</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Tian, N., Poudyal, N. C., Auge R. M., Hodges, D. G.,&amp;Young T. M. (2017). Meta-Analysis of Price Responsiveness of Timber Supply. Forest Products Journal, 67, 152-163. &gt;https://doi.org/10.13073/FPJ-D-16-00017
    </mixed-citation>
   </ref>
   <ref id="scirp.133979-ref21">
    <label>21</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Uusitalo, J. (2010). Introduction to Forest Operations and Technology. JVP Forest Systems.
    </mixed-citation>
   </ref>
   <ref id="scirp.133979-ref22">
    <label>22</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Varis, R. (2018). The Sawmill Industry Handbook. Association of Finnish Sawmillmen.
    </mixed-citation>
   </ref>
   <ref id="scirp.133979-ref23">
    <label>23</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Varjo, J., Henttonen, H., Lappi, J., Heikkonen, J.,&amp;Juujärvi, J. (2006). Digital Horizontal tree Measurements for Forest Inventory. Metlan työraportteja/Working Papers of the Finnish Forest Research Institute 40.
    </mixed-citation>
   </ref>
  </ref-list>
 </back>
</article>