home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.math.num-analysis
- Path: sparky!uunet!boulder!boulder!batra
- From: batra@boulder.Colorado.EDU (sajeev batra)
- Subject: Re: question: how to show that a set of linear inequalities is consistent?
- Message-ID: <batra.722244646@beagle>
- Sender: news@colorado.edu (The Daily Planet)
- Nntp-Posting-Host: beagle.colorado.edu
- Organization: University of Colorado, Boulder
- References: <batra.722077145@beagle> <1992Nov18.091337.23934@walter.cray.com>
- Date: 20 Nov 92 07:30:46 GMT
- Lines: 19
-
- I'd like to thank everyone who responded to my questions. Thank you.
- A number of people asked me for references and I did receive a couple.
- I have not read thru them, but here are the two that I received :
-
- 1)
-
- "Fourier - Motzkin Elimination and Dual" , by George Dantzig and
- Curtis Eaves, Journal of Combinatorial Theory (A) 14, 288 -297 (1973).
-
- 2)
-
- "Locating Minimal Infeasible Constraint Sets in Linear Programs",
- by John Chinneck and Erik Dranieks, Spring 1991 ORSA Journal on
- Computing
-
-
-
- Sajeev Batra
- univ of colorado @ boulder
-