Nonlinear integer goal programming models for acceptance sampling

Arunachalam Ravindran, Wan Seon Shin, Jeffrey L. Arthur, Herbert Moskowitz

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

Two lexicographic goal programming models are developed for determining the optimal sample size and acceptance number for acceptance sampling plans in quality control. Both models address the conflicting criteria inherent in such sampling problems, namely the average lot inspection cost and the average outgoing quality. The first model assumes a known constant lot fraction defective, while the second relaxes this assumption and instead assumes knowledge of a prior distribution on the fraction of defectives. A three-phase algorithm is developed which exploits the problem structure in order to find optimal solutions after examining a small percentage of the feasible sampling plans. On a set of 64 test problems the algorithm always found the optimal solution, typically after evaluating only 3-5% (and never more than 9%) of the feasible points.

Original languageEnglish (US)
Pages (from-to)611-622
Number of pages12
JournalComputers and Operations Research
Volume13
Issue number5
DOIs
StatePublished - Jan 1 1986

Fingerprint

Acceptance Sampling
Goal Programming
Integer programming
Integer Programming
Programming Model
Optimal Solution
Sampling
Quality Control
Prior distribution
Test Problems
Percentage
Inspection
Sample Size
Quality control
Costs
Model
Integer
Goal programming
Acceptance sampling
Optimal solution

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research

Cite this

Ravindran, Arunachalam ; Shin, Wan Seon ; Arthur, Jeffrey L. ; Moskowitz, Herbert. / Nonlinear integer goal programming models for acceptance sampling. In: Computers and Operations Research. 1986 ; Vol. 13, No. 5. pp. 611-622.
@article{f39e203682e94b3990b0504481d0f268,
title = "Nonlinear integer goal programming models for acceptance sampling",
abstract = "Two lexicographic goal programming models are developed for determining the optimal sample size and acceptance number for acceptance sampling plans in quality control. Both models address the conflicting criteria inherent in such sampling problems, namely the average lot inspection cost and the average outgoing quality. The first model assumes a known constant lot fraction defective, while the second relaxes this assumption and instead assumes knowledge of a prior distribution on the fraction of defectives. A three-phase algorithm is developed which exploits the problem structure in order to find optimal solutions after examining a small percentage of the feasible sampling plans. On a set of 64 test problems the algorithm always found the optimal solution, typically after evaluating only 3-5{\%} (and never more than 9{\%}) of the feasible points.",
author = "Arunachalam Ravindran and Shin, {Wan Seon} and Arthur, {Jeffrey L.} and Herbert Moskowitz",
year = "1986",
month = "1",
day = "1",
doi = "10.1016/0305-0548(86)90054-7",
language = "English (US)",
volume = "13",
pages = "611--622",
journal = "Surveys in Operations Research and Management Science",
issn = "0305-0548",
publisher = "Elsevier Limited",
number = "5",

}

Nonlinear integer goal programming models for acceptance sampling. / Ravindran, Arunachalam; Shin, Wan Seon; Arthur, Jeffrey L.; Moskowitz, Herbert.

In: Computers and Operations Research, Vol. 13, No. 5, 01.01.1986, p. 611-622.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Nonlinear integer goal programming models for acceptance sampling

AU - Ravindran, Arunachalam

AU - Shin, Wan Seon

AU - Arthur, Jeffrey L.

AU - Moskowitz, Herbert

PY - 1986/1/1

Y1 - 1986/1/1

N2 - Two lexicographic goal programming models are developed for determining the optimal sample size and acceptance number for acceptance sampling plans in quality control. Both models address the conflicting criteria inherent in such sampling problems, namely the average lot inspection cost and the average outgoing quality. The first model assumes a known constant lot fraction defective, while the second relaxes this assumption and instead assumes knowledge of a prior distribution on the fraction of defectives. A three-phase algorithm is developed which exploits the problem structure in order to find optimal solutions after examining a small percentage of the feasible sampling plans. On a set of 64 test problems the algorithm always found the optimal solution, typically after evaluating only 3-5% (and never more than 9%) of the feasible points.

AB - Two lexicographic goal programming models are developed for determining the optimal sample size and acceptance number for acceptance sampling plans in quality control. Both models address the conflicting criteria inherent in such sampling problems, namely the average lot inspection cost and the average outgoing quality. The first model assumes a known constant lot fraction defective, while the second relaxes this assumption and instead assumes knowledge of a prior distribution on the fraction of defectives. A three-phase algorithm is developed which exploits the problem structure in order to find optimal solutions after examining a small percentage of the feasible sampling plans. On a set of 64 test problems the algorithm always found the optimal solution, typically after evaluating only 3-5% (and never more than 9%) of the feasible points.

UR - http://www.scopus.com/inward/record.url?scp=0022889080&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022889080&partnerID=8YFLogxK

U2 - 10.1016/0305-0548(86)90054-7

DO - 10.1016/0305-0548(86)90054-7

M3 - Article

AN - SCOPUS:0022889080

VL - 13

SP - 611

EP - 622

JO - Surveys in Operations Research and Management Science

JF - Surveys in Operations Research and Management Science

SN - 0305-0548

IS - 5

ER -