<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Forming of the Competitive Investment Programs for Enterprises</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Anatoly V. Panyukov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ekaterina N. Kozina</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>South Ural State University</institution>
          ,
          <addr-line>Chelyabinsk</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The paper presents three economic-mathematical models for the formation of the company's investment program based on: (1) principle of guaranteed net present value; (2) principle of maximizing of the average expected net present value under predetermined upper estimation of its dispersion; (3) principle of maximizing the average expected net present value under predetermined upper estimation of the probability of its inaccessibility. Proposed solutions of the problems allow us to give a system estimation of the enterprise investment attractiveness which can be used in selecting an e ective investment portfolio based on risk appetite of decision makers.</p>
      </abstract>
      <kwd-group>
        <kwd>investment program</kwd>
        <kwd>net present value</kwd>
        <kwd>risk dispersion</kwd>
        <kwd>probability</kwd>
        <kwd>stochastic programming</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>Currently, there are many models of the choice of investment policy. The best
known model of nancial markets is the model of Markowitz-Tobin for portfolio
management [6, 10]. This model allows maximization of the expected result with
acceptable risk. The main element of control is a periodic portfolio diversi cation.</p>
      <p>To implement the strategic objectives of the enterprise also requires e ective
management of its investment activities. The goal of this management is the most
e cient implementation of possible projects bringing the maximum nancial
result with minimal risk under limited investment resources and the uncertainty
of their volumes [2, 3, 9, 12, 13, 16, 17]. In this case the investments are long term,
and the investment program is essentially a strategic plan for development of
the company [3, 13, 16, 17]. This plan is calculated for certain time, and includes
a list of various projects which are listed with the detail volumes of nancial
investments.</p>
      <p>The aim of the paper is to show mathematical models determining the
optimal investment program for the enterprise, i. e. nding the order of
implementation of many independent projects. There are some known heuristic
algorithms [3, 14] for building an investment program which provides the system of
author's preferences. Analyses of the set of e ective investment programs, each
of which: (i) maximizes the expected net present value (NPV) under a certain
level of risk of impossibility to execute the program, (ii) ensures minimal risk
of impossibility of the program for a certain value of the expected NPV, { are
more reasonable way for selection of the optimal enterprise investment program.
As a risk measure, either variance of NPV by analogy with the approach of
Markowitz-Tobin [6, 10] at formation of a portfolio of securities [4, 7], or the
probability of inaccessibility of the desired mean NPV [5, 8] can be used.</p>
      <p>Construction of the e cient investment programs set (i. e. Pareto set by the
criteria space of \risk { NPV") allows to select an e ective investment program
taking into account the risk appetite of decision makers. The paper presents
mathematical models of building a set of e cient investment programs.</p>
      <p>The article consists of four sections, conclusion and bibliography (17
references). Designations and the basic relations are introduced in section 2. A
mathematical model implementing the principle of guaranteed payo is presented
in section 3. Search e cient portfolios under uncertainty and risk [10] are
discussed in the section 4. Two more mathematical models based on di erent de
nitions of the concept of \risk": (i) variance of NPV, (ii) unattainability probability
of expected NPV are proposed. Model example of a problem and the
numerical solution for a variety of options for building the investment program of the
enterprise are considered in section 5. Conclusion summaries the study.
2</p>
      <p>General formulation of the problem
Main criterion for forming an optimal investment program of the enterprise is
NPV of the investment program [1, 11]. Let
{ P = fp1; p2; : : : ; png be set of n of investment projects that can be included
to the investment program;
{ L = fl1; l2; : : : ; lng be set of durations of implementation of investment
projects (i. e. accounting period);
{ m be planning horizon (the number of billing periods);
{ R = fr0; r1; : : : ; rm 1g be xed nancial resources or funding the company's
investment program at billing periods.</p>
      <p>Each of the investment projects pj , j = 1; 2; : : : ; n can be characterized by two
parameters:
{ value Cjs of the net presents value of the project pj that started during s-th
period;
{ need volume Ijsi to nance the investment project pj launched at the period s
over current period i.</p>
      <p>Indicators of income and expenditure are predictable values. They depend on a
number of factors. Therefore it is advisable to consider Cjs and Ijst as random
variables. We receive interval estimations of the net present value [Cjs; Cjs],
needs [Ijst; Ijst], and nancial resources of the enterprise [ri; ri] based on a
retrospective analysis for each project pj , j = 1; 2; : : : ; n, and for all settlement
periods i, s = 1; 2; : : : m.</p>
      <p>Let us introduce the boolean variables
xjs =
(1; beginning of the project pj is period s;</p>
      <p>0; beginning of the project pj is not period s:</p>
      <p>Realizable subset of projects of the set P is a subset of projects that can
be nanced within the available nancial resources for all settlement periods
i; s = 1; 2; : : : m. NPV of the investment program is the sum of discounted net
income of projects included into the investment program [11, 13].</p>
      <p>Since the implementation of the investment project pj may begin no later
than at the period m lj , then the following condition
holds. Conditions for realization of the investment program may be written in
the form
NPV of the whole investment program is equal to</p>
      <p>m lj
Cj = X Cjsxjs:</p>
      <p>
        s=0
C =
n n m lj
X Cj = X X Cjsxjs:
j=1 j=1 s=0
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
(
        <xref ref-type="bibr" rid="ref6">6</xref>
        )
(
        <xref ref-type="bibr" rid="ref7">7</xref>
        )
n i
X X Ijsixjs
j=1 s=0
ri; i = 0; 1; 2; : : : ; m
1:
If investment project pj may be included into the investment program then, in
view of (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ), its NPV be
3
      </p>
    </sec>
    <sec id="sec-2">
      <title>The maximin strategy</title>
      <p>Application cautious strategy aimed at maximizing the guaranteed NPV is
reduced to the solution of the problem</p>
      <p>n m lj
C(x) = X X
here x = fxjs : j = 1; 2; : : : ; n; s = 0; 1; 2; : : : m
the constraints
lj g, admissible set B satis es
n i
X X Ijsixjs
j=1 s=0
ri; i = 0; 1; 2; : : : ; m</p>
      <p>1;</p>
      <p>Building e ective investment programs under risk
It is possible to look for optimal investment program of the enterprise in set
of e ective investment programs (i. e. Pareto set in the space of criteria \risk {
NPV"). Intelligent decision support systems allow to select the most suitable
investment program based on the identi ed system decision-makers preferences.
4.1</p>
      <p>NPV dispersion as risk measure
Let us use the expectation of NPV of the investment program as a measure of
income, and its variance as the risk measure.</p>
      <p>Assuming that the net present value of each project pj 2 P is uniformly
distributed in the interval [Cjs; Cjs] for all s = 1; 2; : : : ; lj we nd the expectation
of net present value</p>
      <p>
        8 n m lj
EfC(x)g = E &lt;X X Cjsxjs
9 n m lj
= = X X (xjs EfCjsg) =
:j=1 s=0
;
We nd the variance of the net present value given the nature of the Boolean
variables x and independence between the net present value of the various projects
8 n m lj
DfC(x)g = D &lt;X X Cjsxjs
9 n m lj
= = X X (xjs DfCjsg) =
:j=1 s=0
;
where x = fxjs : j = 1; 2; : : : ; n; s = 0; 1; 2; : : : m ljg, admissible set D
satis es the constraints (
        <xref ref-type="bibr" rid="ref7">7</xref>
        ){(9), d and e be levels of permissible dispersion and
the expectation respectively.
      </p>
      <p>
        Tasks (10) and (11), as well as the task of (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ){(9), are the problems of Boolean
linear programming with non-negative conditions of the matrix, so they can be
resolved by pseudopolynomial algorithm based on dynamic programming.
      </p>
      <p>Probability of given NPV inaccessibility as risk measure
Let C be a predetermined level NPV. Probability of achieving a given level be
P fC(x) &gt; Cg = P
8&lt;Xn mXlj Cjsxjs &gt; C=9 :
:j=1 s=0 ;
Let us introduce events</p>
      <p>m lj
Ej : X Cjsxjs = yj; j = 1; 2; : : : ; n;
s=0
n
X yj &gt; C
j=1
consist of the fact that the income from the project pj will not be less yj. These
events are used by methods of reduction problems with probabilistic criteria to
a deterministic view [15].</p>
      <p>It follows from (8) and (9) that
Thus, the construction of an e cient investment program at risk is reduced to
problems</p>
      <p>n m lj
EfC(x)g = X X
j=1 s=0</p>
      <p>Cjs + Cjs xjs</p>
      <p>2
n m lj (Cjs
DfC(x)g = X X
j=1 s=0</p>
      <p>Cjs)2
12</p>
      <p>!
xjs
!</p>
      <p>max
! x2D: DfC(x)g d</p>
      <p>;
min
! x2D: EfC(x)g e
;
P fEjg =
m lj m lj
X xjsP fCjs &gt; yjg = X
s=0 s=0
yj
Further instead of maximizing the probability of Pf g we consider the problem
of maximizing its logarithm. Due to the monotony of the logarithmic function
!</p>
      <p>:
!
:
(10)
(11)
(12)
the optimal solutions to both problems are the same. We have</p>
      <p>n 0m lj
ln P fC(x) &gt; Cg = X ln @ X
j=1 s=0
This equation determines the probability of investment program setpoint NPV
inaccessibility, and later this probability is used as a measure of risk.</p>
      <p>Let us introduce determinate variables zji, j = 1; 2; : : : ; n, i = 0; 1; : : : ; m 1
and let us consider events Aji = fIjsi zjig and fBi = Pjn=1 zji rig. Event
Aji means the fact that at period i the resources required by the project pj
started at any period s m lj do not exceed a value of zij. Event Bi means
the fact that the resources required for all performed projects at the period i do
not exceed value ri. Probabilities of the introduced events are</p>
      <p>P fIjsi
zji</p>
      <p>P 8&lt;Xn zji
:j=1</p>
      <p>9
ri= =
;
ri
ri
ri
:</p>
      <p>Let us nd the probability of the conditions 3 realizability of the investment
program considering the variables zji as xed. We have</p>
      <p>8 n i
P &lt;ri(x) = X X Ijsixjs
: j=1 s=0</p>
      <p>9
ri= =</p>
      <p>;
= P 8&lt;Xn zji
:j=1</p>
      <p>9 n m lj
ri= Y X (xjsP fIjsi
; j=1 s=0
zjig) : (14)
for any billing period i = 0; 1; 2; : : : ; m
and taking into account
1 . Finding of equation (14) logarithm
ln P fri(x)
rig =</p>
      <p>P fri(x) &gt; rig ;
ln P fIjsi
8 n
ln P &lt;X zji
:j=1
9
=
ri
;</p>
      <p>8 n
= P &lt;X zji &gt; ri
9
= =
:j=1
;
Ijsi
zji ;
zji
Equation (15) de nes the probability of exceeding of resources required for the
calculation period i = 0; 1; 2; : : : ; m with the enterprise investment program.</p>
      <p>Thus, if be tolerable risk unreachable investment program setpoint NPV,
i be tolerable risk of exceeding the investment program of the enterprise, the
resources required for the calculation period i = 0; 1; 2; : : : ; m then the problem
of de ning the maximum of the expected income can be represented as follows
(16)
(17)
(18)
(19)
(20)
(21)
(22)
C(x; y; z) =
n
X yj ! mx;ya;xz
j=1
m lj</p>
      <p>X Cjsxjs = yj ; j = 1; 2; : : : ; n;
zji
Let us consider the application of the above mathematical models to the next
task. To implement proposed n = 7 investment projects, all projects according
to preliminary calculations are cost-e ective. The planning horizon of the
investment program is m = 11 billing periods. The duration of projects j = 1; 2; : : : ; 7
is the same and amounts to lj = 8 billing periods, thus beginning of any project
is possible only in the billing period s = 0; 1; 2; 3.</p>
      <p>Table 1 contains the interval estimations of projects NPV depending on the
time of s start implementation.</p>
      <p>Table 2 contains interval estimations of the allowed amount of nancing the
company's investment program for the calculation period i.
correspond to di erent Pareto optimal investment programs having an average
NPV equal to 3297 and 3782 respectively. Increasing the level of unreachable
probability of possible expected value of NPV in stochastic models also leads to
various investment programs with increasing average expected value of NPV.</p>
      <p>Since the stochastic model (16){(22), in contrast to the model (10){(11),
allows the risk of exceeding the investment program of the enterprise resources
required for the calculation period, then the potential average expected NPV in
the stochastic model are higher.</p>
      <p>Images of all the projects in Table 4 for the coordinate systems \variance
NPV" { \expected NPV" and \probability unreachable" { \expected NPV" are
shown in Figure 1.</p>
      <p>Investment programs built in the example are e ective (i. e. belong to the
Pareto set in the space of criteria).</p>
    </sec>
    <sec id="sec-3">
      <title>Conclusion</title>
      <p>Considered models of optimal investment program with known distribution of
funds for each period allow to shape the Pareto-optimal investment programs.
Presented modi cation of this model which takes into account the uncertainty
of nancial resource volumes to support investment projects.</p>
      <p>Solutions of the respective tasks provide systematic assessment of investment
attractiveness of the enterprise can be used by intelligent supporting systems for
choice of e cient portfolio based on derivative criteria of performance: (i) the
payback period of the investment, (ii) the rate of return on capital, (iii) the
di erence between the amount of income and investment costs (non-recurring
expenses) for the entire useful life of the investment project, (iv) reduced
production costs, and (v) risk appetite of decision makers.
look. St. Petersburg., 01{03 December". vol. 3, pp. 64{67. Publishing house
\KultInformPress", St. Petersburg (2012)
8. Kozina, E.N.: Mathematical model of the investment program of the enterprise.</p>
      <p>
        In: Proceedings of XII All-Russian Conference on Control (VSPU 2014) Moscow,
June 16{19, 2014. pp. 1250{1253. Institute of Control Sciences, Institute of Control
Sciences, Moscow (2014)
9. Mikhalina, L.M., Golovanov, E.B.: Investment activity variance of small businesses
in a corrupt environment. Bulletin of South Ural State University. Series:
Economics and Management 8(
        <xref ref-type="bibr" rid="ref3">3</xref>
        ), 41{47 (2014)
10. Novoselov, A.A.: Mathematical modeling of nancial risks: Measurement Theory.
      </p>
      <p>
        Nauka, Novosibirsk (2001)
11. Panyukov, A.V.: Mathematical modeling of economic processes. URSS, Moscow
(2009)
12. Schlegel, D., Frank, F., Britzelmaier, B.: Investment decisions and capital
budgeting practices in german manufacturing companies. International Journal of
Business and Globalisation 16(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ), 55{78 (2016)
13. Sergeeva, D.P.: Methods for evaluating the e ectiveness of investment projects
taking into account the recommendations of the ministry of economy. Innovative
science 9, 201{204 (2015)
14. Vilenskiy, V.P.: An approach to the calculation of the in uence of uncertainty and
risk at the e ectiveness of the investment processes. Economics and Mathematical
Methods 2, 29{38 (2012)
15. Vishnaykov, V.B., Kibzun, A.I.: Deterministic equivalents for the problems of
stochastic programming with probabilistic criteria. Automation and Remote
Control 67(
        <xref ref-type="bibr" rid="ref6">6</xref>
        ), 945{961 (2006)
16. Yuzvovich, L.I.: Economical nature and the role of investment in the national
economics. Finance and credit 9, 45{52 (2010)
17. Zhelnova, K.V.: Analysis of decision making practice of investment policy.
Problems of current economics 4, 36{46 (2013)
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Afanasiev</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          :
          <article-title>Optimal investment program</article-title>
          .
          <source>Investments into Russia</source>
          <volume>12</volume>
          ,
          <issue>50</issue>
          {
          <fpage>54</fpage>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Dilger</surname>
            ,
            <given-names>R.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gonzales</surname>
            ,
            <given-names>O.R.</given-names>
          </string-name>
          :
          <article-title>Sba small business investment company program</article-title>
          .
          <source>Journal of Current Issues in Finance, Business and Economics</source>
          <volume>5</volume>
          (
          <issue>4</issue>
          ),
          <volume>407</volume>
          {
          <fpage>417</fpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Gamilova</surname>
            ,
            <given-names>D.A.</given-names>
          </string-name>
          :
          <article-title>Substantiation of e ciency of company's investment policy</article-title>
          .
          <source>Innovation and investment 2</source>
          , 37{
          <fpage>41</fpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Glukhov</surname>
            ,
            <given-names>V.V.</given-names>
          </string-name>
          :
          <article-title>Mathematical methods and models for the management</article-title>
          .
          <source>Lan'</source>
          ,
          <string-name>
            <surname>St. Petersburg</surname>
          </string-name>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Kibzun</surname>
            ,
            <given-names>A.I.</given-names>
          </string-name>
          :
          <article-title>Tasks of stochastic programming with probabilistic criteria</article-title>
          .
          <source>Fizmatlit</source>
          , Moscow (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Kibzun</surname>
            ,
            <given-names>A.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chernobrovov</surname>
            ,
            <given-names>A.I.</given-names>
          </string-name>
          :
          <article-title>Algorithm to solve the generalized markowitz problem</article-title>
          .
          <source>Automation and Remote Control</source>
          <volume>72</volume>
          (
          <issue>2</issue>
          ),
          <volume>289</volume>
          {
          <fpage>304</fpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Kozina</surname>
            ,
            <given-names>E.N.:</given-names>
          </string-name>
          <article-title>The development of economic and mathematical models of the company's investment program</article-title>
          . In:
          <article-title>Proceedings of the international scienti c-practical conference \Modern trends in economics, law</article-title>
          , management,
          <source>mathematics: a new</source>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>