Premium
Describing and Identifying the Complete Set of Target MOTAD Solutions
Author(s) -
McCamley Francis,
Kliebenstein James B.
Publication year - 1987
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/1241701
Subject(s) - parametric programming , set (abstract data type) , parametric statistics , finite set , computer science , regular polygon , mathematical optimization , data mining , mathematics , statistics , programming language , mathematical analysis , geometry
For some Target MOTAD applications, only enterprise mixtures associated with a single target level are of interest. However, in most cases knowledge of other Target MOTAD enterprise mixtures provides useful information. The complete set of Target MOTAD enterprise mixtures is the union of a finite number of closed convex subsets. It can be identified by parametric programming. For well‐behaved problems, only two parameters, target income level ( T ) and expected deviations (λ), need to be varied to identify the set of Target MOTAD mixtures. Data from a problem by Hazell are used to illustrate this technique.