Infeasibility resolution based on goal programming

Authors:
Jian Yang
Affiliations:
Rapt Inc., 625 Second Street, San Francisco, CA 94107, USA
Venue:
Computers and Operations Research
Year:
2008

Citing 3
Cited 1

Detecting IIS in infeasible linear programmes using techniques from goal programming

Computers and Operations Research
Introduction to Linear Optimization

Introduction to Linear Optimization
Combining Minsum And Minmax: A Goal Programming Approach

Operations Research

Goal programming approach for solving transportation problem with interval cost

Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology

Quantified Score

Hi-index	0.01

Visualization

Abstract

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"~ 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.