Abstract
In practice one has often to deal with the problem of inconsistency between constraints, as the result, among others, of the complexity of real models. To overcome these conflicts we can outline two major actions: removal of constraints or changes in the coefficients of the model. This last approach, that can be generically described as “model correction” is the problem we address in this paper. The correction of the right hand side alone was one of the first approaches. The correction of both the matrix of coefficients and the right hand side introduces non linearity in the constraints. The degree of difficulty in solving the problem of the optimal correction depends on the objective function, whose purpose is to measure the closeness between the original and corrected model. Contrary to other norms, the optimization of the important Frobenius was still an open problem. We have analyzed the problem using the KKT conditions and derived necessary and sufficient conditions which enabled us to unequivocally characterize local optima, in terms of the solution of the Total Least Squares and the set of active constraints. These conditions justify a set of pruning rules, which proved, in preliminary experimental results, quite successful in a tree search procedure for determining the global minimizer.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Paula Amaral, Contribuições para o Estudo de Sistemas Lineares Inconsistentes, Ph.D. dissertation, Faculty of Science and Thecnology, UNL, Lisbon, 2001.
Paula Amaral, Pedro Barahona, About infeasibility in the constraints of a linear model, Ricerca Operativa, Vol. 92, pp 49–67, 1999.
P. Amaral, M. W. Trosset, P. Barahona, Correcting an Inconsistent System of Linear Inequalities by Nonlinear Programming, Technical Report 00-27, Department of Computational & Applied Mathematics, Rice University, Houston, TX 77005, 2000.
S. Bistarelli, H. Fargier, U. Montanari, F. Rossi, T. Schiex and G. Ver-faillie, Semiring-based CSPs and Valued CSPs: basic properties and comparison, in Overconstrained Systems, M. Jampel, E. C. Freuder and M. Maher (Eds.), LNCS vol. X, Springer, 1996.
Bart L. R. De Moor, Total linear least squares with inequality constraints, ESAT-SISTA Report 1990-02, March 1990, Department of Electrical Engineering, Katholieke Universiteit Leuven, 1990.
A. Borning, B. Freeman-Benson and M. Wilson, Constraint Hierarchies and Logic Programming, Procs. International Conference on Logic Programming, ICLP’89, MIT Press, 1989
N. Chakravarti, Some results concerning post-infeasibility analysis, EJOR, Vol. 73, pp. 139–143, 1994.
J. W Chinneck and E. W Dravnieks, Locating Minimal Infeasible Constraint Sets in Linear Programs, ORSA Journal on Computing, Vol. 3, No. 2, pp. 157–168, 1991.
James Weldon Demmel, The smallest perturbation of a submatrix which lowers the rank and constrained total least squares problems, Siam Journal Numerical Analysis, Vol. 24, No 1, pp. 199–206, 1987.
D. Dubois, H. Fargier and H. Prade, The Calculus of Fuzzy Restrictions as a Basis for Flexible Constraint Satisfaction, Proc. IEEE International Conference on Fuzzy Systems, IEEE, pp. 1131–1136, 1993
Karl-Heinz Elster (Edt) Modern Mathematical Methods of Optimization, Akademie Verlag, 1993.
E. C. Freuder and R. J. Wallace, Partial Constraint Satisfaction, Artificial Intelligence, Vol. 58, No. 1–3, 21–70, 1992
G. H. Golub and C. F. Van Loan, Matrix Computations
H. J. Greenberg, How to Analyse the Results of Linear Programs-Part 3: Infeasibility Diagnoses, Interfaces, Vol 23, No 6, pp. 120–139, 1993.
C. Holzbaur, F. Menezes and P. Barahona, Defeasibility in CLP(Q) through Generalised Slack Variables, Proceedings of CP’96, 2nd Int. Conf. in Principles and Practice of Constraint Programming, E. C. Freuder(ed.), Lecture Notes in Computer Science, Vol. 1118, Springer-Verlag, pp. 209–223, 1996.
oger A. Horn, Charles R. Johnson, Matrix Analysis, Cambridge University Press, 1985
Javier Pena, Understanding the geometry of infeasible perturbations of a conic linear system, Siam J. Optimization, Vol. 10, No. 2, pp 534–550, 2000.
James Renegar, Some perturbation theory for linear programming, Mathematical Programming, Vol. 65, pp 73–91, 1994.
James Renegar, Linear programming, complexity theory and elementary functional analysis, Mathematical Programming, Vol. 70, pp 279–351, 1995.
G. M. Roodman, Post-Infeasibility Analysis in Linear Programming, Management Science, Vol. 25, No. 9, pp. 916–922, 1979.
Stephen G. Nash, Ariela Sofer, Linear and Nonlinear Programming, McGraw-Hill, 1996.
Sabine van Huffel, The total least squares problem: computational aspects and analysis, Frontiers in applied mathematics, 9, Siam, 1991.
J. N. M. Van Loon, Irreducibly inconsistent systems of linear inequalities, EJOR, Vol. 8, pp. 282–288, 1981.
A. A. Vatolin, An Lp-Based Algorithm for the Correction of Inconsistent Linear Equation and Inequality Systems, Optimization, Vol. 24, pp 157–164, 1992.
A. A. Vatolin, Parametric approximation of inconsistent systems of linear equations and inequalities. Seminarber., Humboldt-Univ. Berlin, Sekt. Math. 81, pp 145–154, 1986.
Jorge R. Vera, Ill-posedness and the complexity of deciding existence of solutions to linear programs, Siam J. Optimization, Vol. 6, No. 3, pp 549–569, 1996.
Hsiao-Fan Wang, Chen-Sheng Huang, Inconsistent structures of linear systems, Int. J. General Systems, Vol. 21, pp 65–81, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Amaral, P., Barahona, P. (2002). On Optimal Correction of Inconsistent Linear Constraints. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_3
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive