Skip to main content
SpringerLink
Log in

On optimal zero-preserving corrections for inconsistent linear systems

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

This paper addresses the problem of finding an optimal correction of an inconsistent linear system, where only the nonzero coefficients of the constraint matrix are allowed to be perturbed for reconstructing a consistent system. Using the Frobenius norm as a measure of the distance to feasibility, a nonconvex minimization problem is formulated, whose objective function is a sum of fractional functions. A branch-and-bound algorithm for solving this nonconvex program is proposed, based on suitably overestimating the denominator function for computing lower bounds. Computational experience is presented to demonstrate the efficacy of this approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Amaldi E., Kann V.: The complexity and approximability of finding maximum feasible subsystems of linear relations. Theor. Comput. Sci. 147, 181–210 (1995)

    Article  Google Scholar 

  2. Amaldi E., Pfetsch M.E., Trotter J.L.E.: On the maximum feasible subsystems, IISs and IIS-hypergraphs. Math. Ser. A 95, 533–554 (2003)

    Article  Google Scholar 

  3. Amaral, P.: Contribuições para o estudo de sistemas lineares inconsistentes. Ph.D Disertation, Faculty of Science and Technology, UNL, Lisbon, Portugal (2001) (in Portuguese)

  4. Amaral P., Barahona P.: About infeasibility in the constraints of a linear model. Ricerca Operativa 92, 49–67 (1999)

    Google Scholar 

  5. Amaral, P., Barahona, P.: On optimal correction of inconsistent linear constraints. In: Hentenryck, P.V. (ed). Principles and Practice of Constraint Programming, CP’2002, NY, (Procs.), Lecture Notes in Computer Science, vol. 2470, pp. 33–46, Springer, Berlin (2002)

  6. Amaral P., Barahona P.: Connections between the total least squares and the correction of an infeasible system of linear inequalities. Linear Algebra Appl. 395, 191–210 (2005)

    Article  Google Scholar 

  7. Amaral P., Barahona P.: A framework for optimal correction of inconsistent linear constraints. Constraints 10, 67–86 (2005)

    Article  Google Scholar 

  8. Amaral P., Júdice J., Sherali H.D.: A reformulation–linearization–convexification algorithm for optimal correction of an inconsistent system of linear constraints. Comput. Oper. Res. 35, 1494–1509 (2008)

    Article  Google Scholar 

  9. Bazaraa M.S., Sherali H.D., Shetty C.M.: Nonlinear Programming: Theory and Algorithms. 3rd edn. Wiley, New York, NY (2006)

    Google Scholar 

  10. Brooke, A., Kendrick, A., Meeraus, A., Raman, R.: GAMS—A User’s Guide. http://www.gams.com/docs/document.htm

  11. Chakravarti N.: Some results concerning post-infeasibility analysis. Eur. J. Oper. Res. 73, 139–143 (1994)

    Article  Google Scholar 

  12. Chinneck J.W.: Minos(ii):Infeasibility analysis using MINOS. Comput. Oper. Res. 21, 1–9 (1994)

    Article  Google Scholar 

  13. Chinneck J.W.: An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem. Ann. Math. Artif. Intell. 17, 127–144 (1996)

    Article  Google Scholar 

  14. Chinneck J.W.: Finding a useful subset of constraints for analysis in an infeasible linear program. INFORMS J. Comput. 9, 164–174 (1997)

    Article  Google Scholar 

  15. Chinneck J.W., Dravnieks E.W.: Locating minimal infeasible constraint sets in linear programs. ORSA J. Comput. 3, 157–168 (1991)

    Google Scholar 

  16. Chinneck J.W., Saunders M.A.: Minos(iis) version 4.2: Analyzing infeasibilities in linear programs. Eur. J. Oper. Res 81, 217–218 (1995)

    Article  Google Scholar 

  17. CPLEX: http://www.ilog.com/products/cplex/

  18. Eremin I.I.: Duality for nonproper problems of linear and convex programming, Dok1. Akad Nauk SSSR 256(252), 272–276 (1981)

    Google Scholar 

  19. Falk J.E., Soland R.M.: Algorithm for separable nonconvex programming problems. Manag. Sci. Ser. A Theory 15, 550–569 (1969)

    Google Scholar 

  20. Greenberg H.J.: Computer-assisted analysis for diagnosing infeasible or unbounded linear programs. Math. Program. Study 31, 79–97 (1987)

    Google Scholar 

  21. Greenberg H.J.: Consistency, redundancy and implied equalities in linear systems. Ann. Math. Artif. Intell. 17, 37–83 (1993)

    Article  Google Scholar 

  22. Greenberg H.J.: Enhancements of analyse: A computer-assisted analysis system for mathematical programming models and solutions. ACM Trans. Math. Softw. 19, 233–256 (1993)

    Article  Google Scholar 

  23. Greenberg H.J.: How to analyze the results of linear programs- Part 3: Infeasibility Diagnoses. Interfaces 23, 120–139 (1993)

    Article  Google Scholar 

  24. Greenberg H.J., Murphy F.H.: Approaches to diagnosing infeasible linear programs. ORSA J. Comput. Study 31, 79–97 (1991)

    Google Scholar 

  25. Guieu O., Chinneck J.W.: Analyzing infeasible mixed-integer and integer linear programs. INFORMS J. Comput. 11, 63–77 (1999)

    Article  Google Scholar 

  26. Holzbaur, C., Menezes, F., Barahona, P.: Defeasibility in CLP(Q) through generalised slack variables. In: Freuder, E.C. (ed.). Proceedings of CP´96, 2nd Int. Conf. in Principles and Practice of Constraint Programming. Lecture Notes in Computer Science, vol. 1118, pp. 209–223. Springer–Verlag, Berlin, (1996)

  27. Horst R., Tuy H.: Global Optimization: Deterministic Approaches. Springer-Verlag, Berlin (1996)

    Google Scholar 

  28. Horst R., Pardalos P., Thoai N.: Introduction to global optimization. 2nd ed. Nonconvex Optimization and Its Applications, 48. Kluwer Academic Publishers, Dordrecht (2000)

    Google Scholar 

  29. LINDO: http://www.lindo.com/

  30. Loon J.N.M.: Irreducible inconsistent systems of linear inequalities. Eur. J. Oper. Res. 8, 282–288 (1981)

    Google Scholar 

  31. Murtagh, B.A., Saunders M.A., Murray, W., Gill, P.E., Raman, R., Kalvelagen, E.: MINOS- NLP solver from Stanford University. http://www.gams.com/docs/document.htm

  32. Pena J.: Understanding the geometry of infeasible perturbations of a conic linear system. SIAM J. Optim. 10, 534–550 (2000)

    Article  Google Scholar 

  33. Renegar J.: Some perturbation theory for linear programming. Math. Program. 65, 73–91 (1994)

    Article  Google Scholar 

  34. Roodman G.M.: Post-infeasibility analysis in linear programming. Manag. Sci. 25, 916–922 (1979)

    Article  Google Scholar 

  35. Sherali H.D., Adams W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer Academic Publishers, Dordrecht (1999)

    Google Scholar 

  36. Sherali H.D., Tuncbilek C.H.: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. J. Glob. Optim. 2, 101–112 (1992)

    Article  Google Scholar 

  37. Tamiz M., Mardle S.J., Jones D.F.: Detecting IIS in infeasible linear programmes using techniques from goal programming. Comput. Oper. Res. 23, 113–119 (1996)

    Article  Google Scholar 

  38. Vatolin A.A.: Parametric approximation of inconsistent systems of linear equations and inequalities. Seminarber., Humboldt-Univ. Berlin Sekt. Math. 81, 145–154 (1986)

    Google Scholar 

  39. Vatolin A.A.: Solvability sets and correction of saddle functions and inequality systems. Ural Branch Acad. Sci. USSR, Sverdlovsk (1989) (in Russian)

  40. Vatolin A.A.: An LP-based algorithm for the correction of inconsistent linear equation and inequality systems. Optimization 24, 157–164 (1992)

    Article  Google Scholar 

  41. Vera J.R.: Ill-posedness and the complexity of deciding existence of solutions to linear programs. SIAM J. Optim. 6, 549–569 (1996)

    Article  Google Scholar 

  42. Wang H.F., Huang C.S.: Inconsistent structures of linear systems. Int. J. Gen. Syst. 21, 65–81 (1992)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Matemática, Universidade Nova de Lisboa, Monte da Caparica, Portugal

    Paula Amaral

  2. Instituto Politécnico de Tomar and Instituto Telecomunicações, Coimbra, Portugal

    Luís M. Fernandes

  3. Departamento de Matemática, Universidade de Coimbra and Instituto Telecomunicações, Coimbra, Portugal

    Joaquim Júdice

  4. Grado Department of Industrial & Systems Engineering, Virginia Polytechnic Institute & State University, Blacksburg, VA, USA

    Hanif D. Sherali

Authors
  1. Paula Amaral
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luís M. Fernandes
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Joaquim Júdice
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hanif D. Sherali
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Paula Amaral.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Amaral, P., Fernandes, L.M., Júdice, J. et al. On optimal zero-preserving corrections for inconsistent linear systems. J Glob Optim 45, 645–666 (2009). https://doi.org/10.1007/s10898-009-9403-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-009-9403-5

Keywords

Search

Navigation