Mark Richard Parker  Home/Search
Context Related
| cudenver.edu/graduate/t...mparker.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cudenver.edu/graduate/the...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: With the increased sophistication of both computers and optimization software, linear programming problems of a size inconceivable to solve only a few years ago are now readily accessible. As model size and complexity increase, the issue of feasibility becomes a major issue in model development. This thesis explores the analysis of linear programming infeasibility through the use of Irreducible Infeasible Subsystems, or I ISs. In particular, we develop a constraint generation algorithm for... (Update)
Context of citations to this paper: More
.... for minimal infeasible subsystems [28, 15] the later ones aim at removing as few constraints as possible to achieve feasibility [60, 57, 58, 13, 29]. The more practical approach in which the modeler is allowed to weight the constraints according to their importance and...
.... for minimal infeasible subsystems [28, 15] the later ones aim at removing as few constraints as possible to achieve feasibility [29, 53, 51, 50, 14]. In fact, the more practical approach in which the modeler is allowed to weight the constraints according to their importance...
Cited by: More
On the Approximability of Some NP-hard Minimization Problems.. - Amaldi, Kann (1996) (Correct)
On the Maximum Feasible Subsystem Problem, IISs and.. - Amaldi, Pfetsch.. (2002) (Correct)
Some Structural and Algorithmic Properties of the.. - Amaldi, Pfetsch.. (2000) (Correct)
Active bibliography (related documents): More All
1.1: On Embedded Languages, Meta-Level Reasoning and.. - Bhargava, Kimbrough (1993) (Correct)
0.6: About Infeasibility in the constraints of a Linear Model - Amaral (1999) (Correct)
0.5: Over-Constrained Systems in CLP and CSP - Jampel (1996) (Correct)
Similar documents based on text: More All
0.6: Sensitivity Analysis And The Analytic Central Path - Holder (1998) (Correct)
0.2: Feasible Flows In Multicommodity Graphs - Zullo (1995) (Correct)
0.2: Intelligent Vehicle-Highway Systems - Engineering (1994) (Correct)
Related documents from co-citation: More All
8: The hardness of approximate optima in lattices (context) - Arora, Babai et al. - 1993
5: Approaches to diagnosing infeasible linear programs (context) - Greenberg, Murphy - 1991
5: Identifying minimally infeasible subsystems of inequalities (context) - Gleeson, Ryan - 1990
BibTeX entry: (Update)
M. Parker. A set covering approach to infeasibility analysis of linear programming problems and related issues. PhD thesis, Department of Mathematics, University of Colorado at Denver, 1995. http://citeseer.ist.psu.edu/parker95set.html More
@misc{ parker95set,
author = "M. Parker",
title = "A set covering approach to infeasibility analysis of linear programming
problems and related issues",
text = "M. Parker. A set covering approach to infeasibility analysis of linear
programming problems and related issues. PhD thesis, Department of Mathematics,
University of Colorado at Denver, 1995.",
year = "1995",
url = "citeseer.ist.psu.edu/parker95set.html" }
Citations (may not include all citations):717 Theory of Linear and Integer Programming (context) - Schrijver - 1986 ACM
518 Integer and Combinatorial Optimization (context) - Nemhauser, Wolsey - 1988 ACM
124 Robust Linear Programming Discrimination of Two Linearly Ins.. - Bennett, Mangasarian - 1992
113 North-Holland (context) - Berge - 1989
69 A Greedy Heuristic for the Set Covering Problem (context) - Chv'atal - 1979
69 Linear Programming (context) - Murty - 1983 ACM
48 The Complexity and Approximability of Finding Maximum Feasib.. - Amaldi, Kann - 1993 ACM DBLP
20 Computers and Intractability (context) - Gary, Johnson - 1979 ACM
14 The Complexity of Vertex Enumeration Methods (context) - Dyer - 1983
14 Locating Minimal Infeasible Constraint Sets in Linear Progra.. (context) - Chinneck, Dravnieks - 1991
14 From Finding Maximum Feasible Subsystems of Linear Systems t.. (context) - Amaldi - 1994
10 Identifying Minimally Infeasible Subsystems of Inequalities (context) - Gleeson, Ryan - 1990
10 On Systems of Linear Inequalities (context) - Fan - 1956
7 the Approximability of Removing the Smallest Number of Relat.. - Amaldi, Kann - 1994
5 Some Results Concerning Post-Infeasibility Analysis (context) - Chakravarti - 1994
4 Transversals of IIS-Hypergraphs (context) - Ryan - 1991
4 Diagnosing Infeasibility in Min-cost Network Flow Problems P.. (context) - Greenberg - 1988
4 Diagnosing Infeasibility in Min-cost Network Flow Problems P.. (context) - Greenberg - 1987
3 Post-Infeasibility Analysis in Linear Programming (context) - Roodman - 1979
2 Finding Minimal Infeasible Sets of Constraints in Infeasible.. (context) - Chinneck - 1993
2 All the Facets with Coefficients in f (context) - Balas, Ng et al. - 1989
2 CCM Report No (context) - Greenberg - 1993
2 IIS--Hypergraphs (context) - Ryan - 1993
1 An Effective Polynomial Time Algorithm for the Minimum Cardi.. (context) - Chinneck - 1995
1 Approaches to Diagnosing Infeasibile Linear Programs (context) - Greenberg, Murphy - 1991
1 An Empirical Analysis of Infeasibility Diagnosis for Instanc.. (context) - Greenberg - 1992
1 Irreducibly Inconsistent Systems of Linear Inequalities (context) - Van Loon - 1981
1 A Feasible-Point Algorithm for Structured Design Systems in .. (context) - Debrosse, Westerberg - 1973
1 A Note on Resolving Infeasiblity in Linear Programs by Const.. (context) - Sankaran - 1993
1 How to Analyze the Results of Linear Programs Part 3: Infeas.. (context) - Greenberg - 1993
1 Improved Linear and Integer Programming Models for Discrimin.. (context) - Glover - 1993
1 Personal Communication to J (context) - Pulleyblank
1 Finding the Most Useful Subset of Constraints for Analysis i.. (context) - Chinneck - 1993
1 Identification of Redundancy by a Set Covering Equivalence (context) - Boneh - 1984
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-math.cudenver.edu/graduate/thesis/index.html): More
Implementation Of The Conjugate Gradient Method Using Short.. - Barth (1996) (Correct)
Simulations Of Prostate Biopsy Methods - Pellish (1997) (Correct)
Domination Graphs Of Near-Regular Tournaments And The.. - Jimenez (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC