<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>03982914</id>
  <dt>j</dt>
  <an>03982914</an>
  <augroup>
    <au>Motskus, J.</au>
    <au>Teshis, V.</au>
    <au>Shaltyanis, V.</au>
    <au>Yushka, F.</au>
  </augroup>
  <ti>On a problem allocation of resources.</ti>
  <so>Teor. Optim. Reshenij 11, 22-28 (1985).</so>
  <py>1985</py>
  <pu>Institut Matematiki i Kibernetiki Akademii Nauk Litovskoj SSR, Vil'nyus</pu>
  <lagroup>
    <la>RU</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>optimal resource allocation</ut>
    <ut>nonlinear integer programming</ut>
    <ut>linear constraints</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
  </ligroup>
  <abgroup>
    <ab>The paper deals with optimal resource allocation for several objects. Each object is characterized by the probability of successful utilization of the allocated resource, and also by loss in case the resource is not utilized or not allocated. This problem is treated as a nonlinear integer programming problem with linear constraints. Such problems are proposed to be solved with the help of algorithms of dynamic programming and rough coordinate minimization. The results of experimental research show that the rough algorithm finds an exact minimum more rapidly than the dynamic programming algorithm.</ab>
    <rv></rv>
  </abgroup>
</item>