IDEAS home Printed from https://ideas.repec.org/a/oup/ajagec/v70y1988i2p397-402..html
   My bibliography  Save this article

Approximating Linear Programs with Summary Functions: Pseudodata with an Infinite Sample

Author

Listed:
  • Paul V. Preckel
  • Thomas W. Hertel

Abstract

A new algorithm for summarizing linear program models that takes advantage of the nature of linear program responses is presented. This method is equivalent to the pseudodata method based on an infinite sample. The power of the new method lies in the fact that the sampling procedure is sequential; the location of the next sample point is determined by observations at previous sample points. An illustration is provided, and the proposed method is compared with pseudodata based on out-of-sample predictions. The comparison indicates the new method is a distinct improvement.

Suggested Citation

  • Paul V. Preckel & Thomas W. Hertel, 1988. "Approximating Linear Programs with Summary Functions: Pseudodata with an Infinite Sample," American Journal of Agricultural Economics, Agricultural and Applied Economics Association, vol. 70(2), pages 397-402.
  • Handle: RePEc:oup:ajagec:v:70:y:1988:i:2:p:397-402.
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.2307/1242081
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Kristiaan Kerstens & Ignace Van de Woestyne, 2021. "Cost functions are nonconvex in the outputs when the technology is nonconvex: convexification is not harmless," Annals of Operations Research, Springer, vol. 305(1), pages 81-106, October.

    More about this item

    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:oup:ajagec:v:70:y:1988:i:2:p:397-402.. 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: Oxford University Press (email available below). General contact details of provider: https://edirc.repec.org/data/aaeaaea.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.