메뉴 건너뛰기




Volumn 9, Issue 2, 1997, Pages 164-174

Finding a useful subset of constraints for analysis in an infeasible linear program

Author keywords

Infeasible

Indexed keywords


EID: 0040579961     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.9.2.164     Document Type: Article
Times cited : (54)

References (28)
  • 1
    • 0345861311 scopus 로고
    • Elastic programming: A new approach to large-scale mixed integer optimization
    • Las Vegas
    • G. BROWN and G. GRAVES, 1975. Elastic Programming: A New Approach to Large-Scale Mixed Integer Optimization, presented at ORSA/TIMS conference, Las Vegas.
    • (1975) ORSA/TIMS Conference
    • Brown, G.1    Graves, G.2
  • 2
    • 20544458015 scopus 로고
    • Systems of linear inequalities
    • W.B. CARVER, 1921. Systems of Linear Inequalities, Annals of Mathematics 23, 212-220.
    • (1921) Annals of Mathematics , vol.23 , pp. 212-220
    • Carver, W.B.1
  • 4
    • 0038848763 scopus 로고
    • Finding the most useful subset of constraints for analysis in an infeasible linear program
    • Systems and Computer Engineering, Carleton University, Ottawa, Canada
    • J.W. CHINNECK, 1993. Finding the Most Useful Subset of Constraints for Analysis in an Infeasible Linear Program, technical report SCE-93-07, Systems and Computer Engineering, Carleton University, Ottawa, Canada.
    • (1993) Technical Report SCE-93-07
    • Chinneck, J.W.1
  • 5
    • 0028271282 scopus 로고
    • MINOS(IIS): Infeasibility analysis using MINOS
    • J.W. CHINNECK, 1994. MINOS(IIS): Infeasibility Analysis Using MINOS, Computers and Operations Research 21, 1-9.
    • (1994) Computers and Operations Research , vol.21 , pp. 1-9
    • Chinneck, J.W.1
  • 6
    • 21444447185 scopus 로고    scopus 로고
    • An effective polynomial-Time heuristic for the minimum-cardinality IIS set-covering problem
    • J.W. CHINNECK, 1996. An Effective Polynomial-Time Heuristic for the Minimum-Cardinality IIS Set-Covering Problem, Annals of Mathematics and Artificial Intelligence 17, 127-144.
    • (1996) Annals of Mathematics and Artificial Intelligence , vol.17 , pp. 127-144
    • Chinneck, J.W.1
  • 8
    • 0029775543 scopus 로고    scopus 로고
    • Computer codes for the analysis of infeasible linear programs
    • J.W. CHINNECK, 1996. Computer Codes for the Analysis of Infeasible Linear Programs, Journal of the Operational Research Society 47, 61-72.
    • (1996) Journal of the Operational Research Society , vol.47 , pp. 61-72
    • Chinneck, J.W.1
  • 9
    • 0026126376 scopus 로고
    • Locating minimal infeasible constraint sets in linear programs
    • J.W. CHINNECK and E.W. DRAVNIEKS, 1991. Locating Minimal Infeasible Constraint Sets in Linear Programs, ORSA Journal on Computing 3, 157-168.
    • (1991) ORSA Journal on Computing , vol.3 , pp. 157-168
    • Chinneck, J.W.1    Dravnieks, E.W.2
  • 10
    • 20544446846 scopus 로고    scopus 로고
    • CPLEX Optimization Inc, 1994. USING THE CPLEX CALLABLE LIBRARY, CPLEX Optimization Inc, Incline Village, NV
    • CPLEX Optimization Inc, 1994. USING THE CPLEX CALLABLE LIBRARY, CPLEX Optimization Inc, Incline Village, NV.
  • 11
    • 0020799155 scopus 로고
    • The complexity of vertex enumeration methods
    • M.E. DYER, 1983. The Complexity of Vertex Enumeration Methods, Mathematics of Operations Research 8, 381-402.
    • (1983) Mathematics of Operations Research , vol.8 , pp. 381-402
    • Dyer, M.E.1
  • 12
    • 0347278771 scopus 로고
    • Identifying minimally infeasible subsystems of equations, ORSA
    • J. GLEESON and J. RYAN, 1990. Identifying Minimally Infeasible Subsystems of Equations, ORSA Journal on Computing 2, 61-63.
    • (1990) Journal on Computing , vol.2 , pp. 61-63
    • Gleeson, J.1    Ryan, J.2
  • 13
    • 0020720610 scopus 로고
    • A functional description of ANALYZE: A computer-assisted analysis system for linear programming models
    • H.J. GREENBERG, 1983. A Functional Description of ANALYZE: A Computer-Assisted Analysis System for Linear Programming Models, ACM Transactions on Mathematical Software 9, 18-56.
    • (1983) ACM Transactions on Mathematical Software , vol.9 , pp. 18-56
    • Greenberg, H.J.1
  • 14
    • 0040873476 scopus 로고
    • Diagnosing infeasibility for min-cost network flow models. I. dual infeasibility
    • H.J. GREENBERG, 1987. Diagnosing Infeasibility for Min-Cost Network Flow Models. I. Dual Infeasibility, IMA Journal of Mathematics in Management 1, 99-109.
    • (1987) IMA Journal of Mathematics in Management , vol.1 , pp. 99-109
    • Greenberg, H.J.1
  • 15
    • 0023410661 scopus 로고
    • Computer-assisted analysis for diagnosing infeasible or unbound linear programs
    • H.J. GREENBERG, 1987. Computer-Assisted Analysis for Diagnosing Infeasible or Unbound Linear Programs, Mathematical Programming Studies 31, 79-97.
    • (1987) Mathematical Programming Studies , vol.31 , pp. 79-97
    • Greenberg, H.J.1
  • 16
    • 0023453567 scopus 로고
    • ANALYZE: A computer-assisted analysissystem for linear programming models
    • H.J. GREENBERG, 1987. ANALYZE: A Computer-Assisted AnalysisSystem for Linear Programming Models, Operations Research Letters 6, 249-255.
    • (1987) Operations Research Letters , vol.6 , pp. 249-255
    • Greenberg, H.J.1
  • 18
    • 0009580166 scopus 로고
    • An empirical analysis of infeasibility diagnosis for instances of linear programming blending models
    • H.J. GREENBERG, 1992. An Empirical Analysis of Infeasibility Diagnosis for Instances of Linear Programming Blending Models, IMA Journal of Mathematics in Business & Industry 4, 163-210.
    • (1992) IMA Journal of Mathematics in Business & Industry , vol.4 , pp. 163-210
    • Greenberg, H.J.1
  • 20
    • 21344494344 scopus 로고
    • How to analyze the results of linear programs. 3. infeasibility diagnosis
    • H.J. GREENBERG, 1993. How to Analyze the Results of Linear Programs. 3. Infeasibility Diagnosis, Interfaces 23, 120-139.
    • (1993) Interfaces , vol.23 , pp. 120-139
    • Greenberg, H.J.1
  • 23
    • 0003446306 scopus 로고
    • technical report SOL 83-20R, Systems Optimization Laboratory, Department of Operations Research, Stanford University
    • B.A. MURTAGH and M.A. SAUNDERS, 1987. MINOS 5.1 User's Guide, technical report SOL 83-20R, Systems Optimization Laboratory, Department of Operations Research, Stanford University.
    • (1987) MINOS 5.1 User's Guide
    • Murtagh, B.A.1    Saunders, M.A.2
  • 25
    • 21444451485 scopus 로고
    • Finding the minimum weight IIS cover of an infeasible system of linear inequalities
    • to appear
    • M. PARKER and J. RYAN, 1995. Finding the Minimum Weight IIS Cover of an Infeasible System of Linear Inequalities, Annals of Mathematics and Artificial Intelligence, to appear.
    • (1995) Annals of Mathematics and Artificial Intelligence
    • Parker, M.1    Ryan, J.2
  • 27
    • 20544459285 scopus 로고
    • Detecting IIS in infeasible linear programmes using techniques from goal programming
    • to appear
    • M. TAMIZ, S.J. MARDLE, and D.F. JONES, 1994. Detecting IIS in Infeasible Linear Programmes using Techniques from Goal Programming, Computers and Operations Research, to appear.
    • (1994) Computers and Operations Research
    • Tamiz, M.1    Mardle, S.J.2    Jones, D.F.3
  • 28
    • 0019635836 scopus 로고
    • Irreducibly inconsistent systems of linear inequalities
    • J. VAN LOON, 1981. Irreducibly Inconsistent Systems of Linear Inequalities, European Journal of Operational Research 8, 283-288.
    • (1981) European Journal of Operational Research , vol.8 , pp. 283-288
    • Van Loon, J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.