logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Solving quality control problems with an algorithm for minimax programs with coupled constraints

delete2014-01-01
delete0
PRE
AI
B
Belmiro P.M. Duarte *
A
Angelos Tsoukalas
DOI：10.1016/j.cor.2013.07.009delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
We propose a systematic algorithm to tackle a set of acceptance sampling problems introduced by Seidel [1] and their generalization when no prior knowledge is assumed. The problems are modeled as minimax problems with coupled or decoupled constraints. We use ideas from recent work on bi-level programming, reformulating the problem as a semi-infinite program with disjunctive constraints and employing a two phase discretization method to solve it. We use the KKT conditions of the inner problem of minimax to tighten the relaxation of the semi-infinite problem obtained by discretization. In addition, to avoid convergence trouble, a strategy based on a feasibility test relative to the objective value of the outer program is used. (C) 2013 Elsevier Ltd. All rights reserved.
Keywords:
Acceptance sampling design
Minmax problems
Non-convex constraints
Coupled constraints
Bilevel programming
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

C
Computers and Operations Research
IF:
4.3
Papers:
6.5K
Citations:
1.8W

Organization

No organization information available