A preemptive single sampling attribute plan of given strength (Q1821474)

The problem of determining a single sampling plan (n,c) so that \(1-P(p_ 1)\leq \alpha\), \(P(p_ 2)\leq \beta\) and c is as small as possible where P(p) denotes the operating characteristic of the plan has been modelled as a nonlinear integer goal programming problem. The conflicting goals of satisfying the producer's and consumer's risks, and of achieving less inspection has been taken into account in the model with the help of preemptive priority factors and with appropriate weight factors for the deviational variables in the same priority levels. A solution method has been developed for the Poisson case.