A Branching Process for Convergent Product Optimization

Ermia Aghasi, Mansour Momeni, Mohammad Ali Shah Hoseini

Abstract


We consider a discrete time branching process where the population consists of k types of convergent products, an action is chosen for that which affects the lifetime, the number and types of its functions, and the profit received. The problem of maximizing the expected profit is shown to be equivalent to a generalized Markov decision problem of maximizing the expected profit is shown to be equivalent to a generalized Markov decision problem where the  transition matrices are non-negative but not necessarily sub stochastic.


Full Text:

PDF


DOI: http://dx.doi.org/10.22158/rem.v2n4p1

Refbacks

  • There are currently no refbacks.


Copyright (c) 2017 Ermia Aghasi, Mansour Momeni, Mohammad Ali Shah Hoseini

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Copyright © SCHOLINK INC.  ISSN 2470-4407 (Print)  ISSN 2470-4393 (Online)