Abstract
In this paper, optimal sampling inspection plans with AOQL are studied by determining the optimal compressed limit. The model of this problem is formulated by mathematical programming with the objective function given by average total inspected of three variables; sampling plan (n, c) and the compressed limit S_U', subject to a given value of AOQL0. To find the optimal value of SU', Lagrange multiplier method is used as a heuristic approach, and some tables of the sampling plans are given showing average total inspected can be less than one fifth of the conventional ones.
