On the maximum feasible subsystem problem, IISs and IIS-hypergraphs

Mathematical Programming, Series B

Volumn 95, Issue 3, 2003, Pages 533-554

  Amaldi, Edoardo ^a   Pfetsch, Marc E ^b   Trotter Jr , Leslie E ^c  

^a POLITECNICO DI MILANO   (Italy)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^c Department of Obstetrics Gynecology   (United States)

Author keywords

Feasible subsystem polytope; Feasible subsystems ; IiS hypergraphs; Independence systems; Infeasible linear systems; Irreducible infeasible subsystem (Us); Rank facets

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GRAPH THEORY;

FEASIBLE SUBSYSTEM POLYTOPE; FEASIBLE SUBSYSTEMS; IIS-HYPERGRAPHS; INDEPENDENCE SYSTEMS; INFEASIBLE LINEAR SYSTEMS; IRREDUCIBLE INFEASIBLE SUBSYSTEM (US); RANK FACETS;

PROBLEM SOLVING;

EID: 12444272680     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-002-0363-5     Document Type: Article

References (49)

1. Aggarwal, C.C., Ahuja, R.K., Hao, J., Orlin, J.B.: Diagnosing infeasibilities in network flow problems. Math. Program. 81, 263-280 (1998)
2. Amaldi, E.: From finding maximum feasible subsystems of linear systems to feedforward neural network design, Ph.D. thesis, Dep. of Mathematics EPF-Lausanne, October 1994
3. Amaldi, E., Hauser, R.: Randomized relaxation methods for the maximum feasible subsystem problem, Tech. Report N. 01-90, DEI Politecnico di Milano, Italy 2001
4. Amaldi, E., Kann, V.: The complexity and approximability of finding maximum feasible subsystems of linear relations. Theoret. Comput. Sci. 147, 181-210 (1995)
5. Amaldi, E., Kann, V.: On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems. Theoret. Comput. Sci. 209, 237-260 (1998)
6. Amaldi, E., Mattavelli, M.: The MIN PFS problem and piecewise linear model estimation. Dis. Appl. Math. 118, 115-143 (2002)
7. Amaldi, E., Pfetsch, M.E., Trotter, L.E. Jr.: Some structural and algorithmic properties of the maximum feasible subsystem problem. In: Proceedings of the 10th Integer Programming and Combinatorial Optimization Conference (IPCO'99), G. Cornuéjols, R. Burkard, G. Woeginger (eds), Springer-Verlag, Lecture Notes in Comput. Sci. 1610, pp. 45-59, 1999
8. Arora, S., Babai, L., Stern, J., Sweedyk, Z.: The hardness of approximate optima in lattices, codes, and systems of linear equations. J. Comput. Syst. Sci. 54(2), 317-331 (1997)
9. Balas, E., Ng, S.M.: On the set covering polytope: All the facets with coefficients in {0,1,2}, Math. Program. 43, 57-69 (1989)
10. Bennett, K.P., Bredensteiner, E.: A parametric optimization method for machine learning. INFORMS J. Comput. 9, 311-318 (1997)
11. Berge, C.: Graphs and Hypergraphs, 2nd, edn. North-Holland, 1976
12. Björner, A.: Topological methods. Handbook of Combinatorics. Vol. II, R.L. Graham, M. Grötschel, L. Lovász (eds), North-Holland, pp. 1819-1872, 1995
13. Björner, A., Las Vergnas, M., Sturmfels, B., White, N., Ziegler, G.M.: Oriented Matroids, 2nd edn., Encyclopedia of Mathematics and its Applications, Cambridge University Press, 1999
14. Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation, Springer-Verlag, 1997
15. Bokowski, J., Sturmfels, B.: Computational synthetic geometry. Lecture Notes in Math., no. 1355, Springer-Verlag, 1989
16. Ceria, S., Nobili, P., Sassano, A.: Set covering problem. In: Annotated Bibliographies in Combinatorial Optimization, M. Dell'Amico, F. Maffioli, S. Martello (eds), John Wiley, 1997
17. Chakravarti, N.: Some Results concerning post-infeasibility analysis. Eur. J. Oper. Res. 73, 139-143 (1994)
18. Chinneck, J.W.: Computer codes for the analysis of infeasible linear programs. J. Oper. Res. Soc. 47, 61-72 (1996)
19. Chinneck, J.W.: An effective polynomial-time heuristic for the minimum-cardinality US set-covering problem. Ann. Math. Artificial Intelligence 17, 127-144 (1996)
20. Chinneck, J.W.: Finding a useful subset of constraints for analysis in an infeasible linear program. INFORMS J. Comput. 9(2), 164-174 (1997)
21. Chinneck, J.W.: Fast heuristics for the maximum feasible subsystem problem. INFORMS J. Comput. 13(3), 210-223 (2001)
22. Chinneck, J.W., Dravnieks, E.: Locating minimal infeasible constraint sets in linear programs. ORSA J. Comput. 3, 157-168 (1991)
23. Fan, K.: On Systems of Linear Inequalities. In: Linear Inequalities and Related Systems, H.W. Kuhn, A.W. Tucker (eds), Ann. of Math. Stud., no. 38, Princeton University Press, NJ, pp. 99-156, 1956
24. Frean, M.: A "thermal" perceptron learning rule. Neural Comput. 4(6), 946-957 (1992)
25. Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-completeness, W.U. Freeman, Company, San Francisco, 1979
26. Gleeson, J., Ryan, J.: Identifying minimally infeasible subsystems of inequalities. ORSA J. Comput. 2(1), 61-63 (1990)
27. Greenberg, H.J.: Consistency, redundancy, and implied equalities in linear systems. Ann. Math. Artificial Intelligence 17, 37-83 (1996)
28. Greenberg, HJ., Murphy, F.H.: Approaches to diagnosing infeasible linear programs. ORSA J. Comput. 3, 253-261 (1991)
29. Greer, R.: Trees and hills: Methodology for maximizing functions of systems of linear relations. Ann. Discrete Math., vol. 22, Elsevier science publishing company, Amsterdam, 1984
30. Håstad, J.: Some optimal inapproximability results. J. ACM 48, 798-859 (2001)
31. Johnson, D.S., Preparata, P.P.: The densest hemisphere problem. Theoret. Comput. Sci. 6, 93-107 (1978)
32. Joswig, M., Kaibel, V., Pfetsch, M.E., Ziegler, G.M.: Vertex-facet incidences of unbounded polyhedra. Adv. Geom. 1(1), 23-36 (2001)
33. Laurent, M.: A generalization of antiwebs to independence systems and their canonical facets. Math. Program. 45, 97-108 (1989)
34. Mangasarian, O.L.: Misclassification minimization. J. Global Optim. 5(4), 309-323 (1994)
35. Mishra, B.: Computational real algebraic geometry. In: Handbook of Discrete and Computational Geometry, J. Goodman, J. O'Rouke (eds), CRC Press, 1997
36. Mnëv, N.E.: The universality theorems on the classification problem of configuration varieties and convex polytopes varieties. Topology and Geometry - Rohlin Seminar, O. Ya Viro (ed.), Lecture Notes in Math., no. 1346, Springer-Verlag, pp. 527-543, 1988
37. Motzkin, T.S.: Beiträge zur Theorie der Linearen Ungleichungen, Ph.D. thesis. University of Basel, 1933
38. Parker, M.: A set covering approach to infeasibility analysis of linear programming problems and related issues, Ph.D. thesis Dep. of Mathematics, University of Colorado at Denver, 1995
39. Parker, M., Ryan, J.: Finding the minimum weight US cover of an infeasible system of linear inequalities. Ann. Math. Artificial Intelligence 17 107-126 (1996)
40. Pfetsch, M.E.: Examples of generalized antiweb facets, Electronic Geometry Models, No. 2000.09.029, available at http://www.eg-models.de, 2000
41. Netlib Repository, available at http://www.netlib.org
42. Richter-Gebert, J.: Realization spaces of polytopes, Lecture Notes in Math., no. 1643, Springer-Verlag, 1996
43. Rossi, F., Sassano, A., Smriglio, S.: Models and algorithms for terrestrial digital broadcasting. Ann. Oper. Res. 107, 267-283 (2001)
44. Ryan, J.: Transversals of IIS-hypergraphs. Congr. Numer. 81, 17-22 (1991)
45. Ryan, J.: IIS-hypergraphs. SIAM J. Dis. Math. 9, 643-653 (1996)
46. Sankaran, J.: A note on resolving infeasibility in linear programs by constraint relaxation. Oper. Res. Lett. 13, 19-20 (1993)
47. Tamiz, M., Mardle, S.J., Jones, D.F.: Detecting US in infeasible linear programmes using techniques from goal programming. Comput. Oper. Res. 23(2), 113-119 (1996)
48. van Loon, J.N.M.: Irreducibly inconsistent systems of linear inequalities. Eur. J. Oper. Res. 8, 282-288 (1981)
49. Ziegler, G.M.: Lectures on polytopes, Springer-Verlag, New York, 1995, Revised edition 1998