Premium
Approximating Linear Programs with Summary Functions: Pseudodata with an Infinite Sample
Author(s) -
Preckel Paul V.,
Hertel Thomas W.
Publication year - 1988
Publication title -
american journal of agricultural economics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.949
H-Index - 111
eISSN - 1467-8276
pISSN - 0002-9092
DOI - 10.2307/1242081
Subject(s) - sample (material) , sample size determination , sampling (signal processing) , computer science , point (geometry) , power (physics) , mathematics , statistics , algorithm , geometry , chemistry , physics , filter (signal processing) , chromatography , quantum mechanics , computer vision
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.