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

Infeasibility resolution based on goal programming

delete2008-05-01
delete9
PRE
AI
J
Jian Yang *
DOI：10.1016/j.cor.2006.08.006delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Infeasibility resolution is an important aspect of infeasibility analysis. This paper proposes a multi-objective programming model for infeasibility resolution and develops a method based on l(infinity) norm goal programming to solve the problem. Any solution is at least weakly efficient and any efficient solution is reachable by regulating the weights. For the special case of irreducibly inconsistent linear systems, any solution is guaranteed to be efficient. The method is capable of handling both linear and nonlinear/non-convex cases, as demonstrated by the numerical examples. (c) 2006 Elsevier Ltd. All rights reserved.
Keywords:
infeasibility analysis
goal programming
IIS
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