IDEAS home Printed from https://ideas.repec.org/p/col/000122/013679.html
   My bibliography  Save this paper

Determining the Optimal Selling Time of Cattle: A Stochastic Dynamic Programming Approach

Author

Listed:
  • Susana Mejía
  • Andrés Ramírez Hassan

Abstract

The world meat market demands competitiveness and optimal livestock replacement decisions can help to achieve this goal. We introduce a novel discrete stochastic dynamic programming framework to support a manager’s decision-making process of whether to sell or keep fattening animals in the beef sector. In particular, our proposal uses a non-convex value function, combining both economic and biological variables, and involving uncertainty with regard to price fluctuations. Our methodology is very general, so practitioners can apply it in different regions around the world. We illustrate the model’s convenience with an empirical application, finding that our methodology generates better results than actions based on empirical experience.

Suggested Citation

  • Susana Mejía & Andrés Ramírez Hassan, 2015. "Determining the Optimal Selling Time of Cattle: A Stochastic Dynamic Programming Approach," Documentos de Trabajo de Valor Público 13679, Universidad EAFIT.
  • Handle: RePEc:col:000122:013679
    as

    Download full text from publisher

    File URL: https://repository.eafit.edu.co/handle/10784/7349#.VetHmJ1Vikp
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Decision Analysis; Farm Management; Simulation.;
    All these keywords.

    JEL classification:

    • Q12 - Agricultural and Natural Resource Economics; Environmental and Ecological Economics - - Agriculture - - - Micro Analysis of Farm Firms, Farm Households, and Farm Input Markets
    • C51 - Mathematical and Quantitative Methods - - Econometric Modeling - - - Model Construction and Estimation
    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:col:000122:013679. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Valor Público EAFIT - Centro de estudios e incidencia (email available below). General contact details of provider: https://edirc.repec.org/data/cieafco.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.