.png){kind=icon}
返回
Solving quality control problems with an algorithm for minimax programs with coupled constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2013.07.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Acceptance sampling design
Minmax problems
Non-convex constraints
Coupled constraints
Bilevel programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
LINKING ONTOLOGICAL RESOURCES USING AGGREGATABLE SUBSTANCE IDENTIFIERS TO ORGANIZE EXTRACTED RELATIONS使用可聚合的物质标识符链接本体资源以组织提取的关系
PREAI
分享收藏The Influence of σ and π Acceptors on Two‐Photon Absorption and Solvatochromism of Dipolar and Quadrupolar Unsaturated Organic Compounds.png)
ChemPhysChem
ChemPhysChemIF0
PREAI
分享收藏Sentence Co-occurrences as Small-World Graphs: A Solution to Automatic Lexical Disambiguation句内共现作为小世界图：自动词汇消歧的解决方案
PREAI
分享收藏
查看更多内容