<?xml version="1.0" encoding="UTF-8"?>
<osRepository xmlns="os.optimizationservices.org" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="os.optimizationservices.org http://www.optimizationservices.org/schemas/osRepository.xsd">
	<!--OSRepository.xml: version - 1.0.0-->
	<description>Optimization Services Repository (OSRepository)</description>
	<news>
		<el time="2006-02-01T09:30:00.000-06:00">First creation of the OSRepository. Original problems are mainly from the NetLib Repository (maintained by David Gay) and are all linear continuous. The "Kennington" problems from Netlib and John Chinneck's infeasible problem set are also included.  [Jun Ma (Northwestern Univeristy), Kipp Martin (University of Chicago) and Huanyuan Sheng (Northwestern Univeristy)]</el>
	</news>
	<!-- Netlib Problems-->
	<instance>
		<name>25FV47</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by John Reid on a tape sent to David Gay. </source>
		<description>objectives: 1 (minimization); constraints: 821; variables: 1571; nonzeros (obj coefs + constraint coefs): 11127; reported optimal value: 5.5018458883E+03. This problem is sometimes called BP or BP1. </description>
		<originalFileName>25fv47.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>25fv47.osil</osFileName>
	</instance>
	<instance>
		<name>80BAU3B</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of the probelm is: W. Kurator and Harvey Greenberg, Energy Information Administration (Greenberg is now at the Univ. of Colorado - Denver). GREENBEA, GREENBEB: a large refinery model; see the book "A Model-Management Framework for Mathematical Programming" by Kenneth H. Palmer et al. (John Wiley and Sons, New York, 1984). </source>
		<description>objectives: 1 (minimization); constraints: 2262; variables: 9799; nonzeros (obj coefs + constraint coefs): 29063; reported optimal value: 9.8723216072E+05</description>
		<originalFileName>80bau3b.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>80bau3b.osil</osFileName>
	</instance>
	<instance>
		<name>ADLITTLE</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Michael Saunders from the Systems Optimization Laboratory at Stanford University.</source>
		<description>objectives: 1 (minimization); constraints: 56; variables: 97; nonzeros (obj coefs + constraint coefs): 465; reported optimal value: 2.2549496316E+05	
		</description>
		<originalFileName>adlittle.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>adlittle.osil</osFileName>
	</instance>
	<instance>
		<name>AFIRO</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Michael Saunders from the Systems Optimization Laboratory at Stanford University.</source>
		<description>objectives: 1 (minimization); constraints: 27; variables: 32; nonzeros (obj coefs + constraint coefs): 88; reported optimal value: -4.6475314286E+02</description>
		<originalFileName>afiro.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>afiro.osil</osFileName>
	</instance>
	<instance>
		<name>AGG</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Mauricio Resende and formulated by R. C. Leachman</source>
		<description>objectives: 1 (minimization); constraints: 488; variables: 163; nonzeros (obj coefs + constraint coefs): 2541; reported optimal value: -3.5991767287E+07</description>
		<originalFileName>agg.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>agg.osil</osFileName>
	</instance>
	<instance>
		<name>AGG2</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Mauricio Resende and formulated by R. C. Leachman</source>
		<description>objectives: 1 (minimization); constraints: 516; variables: 302; nonzeros (obj coefs + constraint coefs): 4515; reported optimal value: -2.0239252356E+07</description>
		<originalFileName>agg2.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>agg2.osil</osFileName>
	</instance>
	<instance>
		<name>AGG3</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Mauricio Resende and formulated by R. C. Leachman</source>
		<description>objectives: 1 (minimization); constraints: 516; variables: 302; nonzeros (obj coefs + constraint coefs): 4531; reported optimal value: 1.0312115935E+07</description>
		<originalFileName>agg3.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>agg3.osil</osFileName>
	</instance>
	<instance>
		<name>BANDM</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Michael Saunders from the Systems Optimization Laboratory at Stanford University.</source>
		<description>objectives: 1 (minimization); constraints: 305; variables: 472; nonzeros (obj coefs + constraint coefs): 2659; reported optimal value: -1.5862801845E+02</description>
		<originalFileName>bandm.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>bandm.osil</osFileName>
	</instance>
	<instance>
		<name>BEACONFD</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Michael Saunders from the Systems Optimization Laboratory at Stanford University.</source>
		<description>objectives: 1 (minimization); constraints: 173; variables: 262; nonzeros (obj coefs + constraint coefs): 3476; reported optimal value: 3.3592485807E+04</description>
		<originalFileName>beaconfd.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>beaconfd.osil</osFileName>
	</instance>
	<instance>
		<name>BLEND</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Nick Gould from the Harwell collection of LP test problems. </source>
		<description>objectives: 1 (minimization); constraints: 74; variables: 83; nonzeros (obj coefs + constraint coefs): 521; reported optimal value: -3.0812149846E+01. Nick Gould says that BLEND "is is a variant of the [oil refinery] problem in Murtagh's book (the coefficients are different) which, in David Gay's understanding, John Reid obtained from the people at NPL. In converting the MPS file, Jun Ma filled the RHS section in the MPS file with dummy RHS labels. </description>
		<originalFileName>blend.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>blend.osil</osFileName>
	</instance>
	<instance>
		<name>BNL1</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by John Tomlin with the permission of Ketron.</source>
		<description>objectives: 1 (minimization); constraints: 643; variables: 1175; nonzeros (obj coefs + constraint coefs): 6129; reported optimal value: 1.9776292856E+03. When solving the problem, MINOS 5.3 reports that 169 out of 1614 steps (10.47%) are degenerate.</description>
		<originalFileName>bnl1.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>bnl1.osil</osFileName>
	</instance>
	<instance>
		<name>BNL2</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by John Tomlin with the permission of Ketron.</source>
		<description>objectives: 1 (minimization); constraints: 2324; variables: 3849; nonzeros (obj coefs + constraint coefs): 16124; reported optimal value: 1.8112365404E+03. When solving the problem, MINOS 5.3 reports that 906 out of 4914 steps (18.44%) are degenerate.</description>
		<originalFileName>bnl2.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>bnl2.osil</osFileName>
	</instance>
	<instance>
		<!-- possible warning
unprepared constrain type
unprepared constrain type
unprepared constrain type
unprepared constrain type
...
-->
		<name>BOEING1</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Nick Gould from the Harwell collection of LP test problems.</source>
		<description>objectives: 1 (minimization); constraints: 350; variables: 384; nonzeros (obj coefs + constraint coefs):3865; reported optimal value: -3.3521356751E+02. According to Nick Gould, BOEING1 and BOEING2 "have to do with flap settings on aircraft for economical operations".  These two problems were originally mixed-integer programming problems. These problems also had a few rows defined as linear combinations of other rows.  These rows are now given explicitly due to limits related with the MPS format.</description>
		<originalFileName>boeing1.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>boeing1.osil</osFileName>
	</instance>
	<instance>
		<!-- possible warning
unprepared constrain type
unprepared constrain type
unprepared constrain type
unprepared constrain type
...
-->
		<name>BOEING2</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Nick Gould from the Harwell collection of LP test problems.</source>
		<description>objectives: 1 (minimization); constraints: 166; variables: 143; nonzeros (obj coefs + constraint coefs): 1339; reported optimal value: -3.1501872802E+02. According to Nick Gould, BOEING1 and BOEING2 "have to do with flap settings on aircraft for economical operations". These two problems were originally mixed-integer programming problems. These problems also had a few rows defined as linear combinations of other rows.  These rows are now given explicitly due to limits related with the MPS format.</description>
		<originalFileName>boeing2.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>boeing2.osil</osFileName>
	</instance>
	<instance>
		<name>BORE3D</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy through consulting. </source>
		<description>objectives: 1 (minimization); constraints: 233; variables: 315; nonzeros (obj coefs + constraint coefs): 1525; reported optimal value: 1.3730803942E+03</description>
		<originalFileName>bore3d.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>bore3d.osil</osFileName>
	</instance>
	<instance>
		<name>BRANDY</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Michael Saunders from the Systems Optimization Laboratory at Stanford University.</source>
		<description>objectives: 1 (minimization); constraints: 221 cols:249; nonzeros (obj coefs + constraint coefs): 2150; reported optimal value: 1.5185098965E+03</description>
		<originalFileName>brandy.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>brandy.osil</osFileName>
	</instance>
	<instance>
		<name>CAPRI</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Michael Saunders from the Systems Optimization Laboratory at Stanford University.</source>
		<description>objectives: 1 (minimization); constraints: 271; variables: 353; nonzeros (obj coefs + constraint coefs): 1786; reported optimal value: 2.6900129138E+03</description>
		<originalFileName>capri.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>capri.osil</osFileName>
	</instance>
	<instance>
		<name>CYCLE</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by John Tomlin with the permission of Ketron.</source>
		<description>objectives: 1 (minimization); constraints: 1903; variables: 2857; nonzeros (obj coefs + constraint coefs): 21322; reported optimal value: -5.2263930249E+00. When solving the problem, MINOS 5.3 reports that 1485 out of 3156 steps (47.05%) are degenerate.</description>
		<originalFileName>cycle.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>cycle.osil</osFileName>
	</instance>
	<instance>
		<name>CZPROB</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by John Reid on a tape sent to David Gay. </source>
		<description>objectives: 1 (minimization); constraints: 929; variables: 3523; nonzeros (obj coefs + constraint coefs): 14173; reported optimal value: 2.1851966989E+06</description>
		<originalFileName>czprob.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>czprob.osil</osFileName>
	</instance>
	<instance>
		<name>D2Q06C</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by John Tomlin with the permission of Ketron.</source>
		<description>objectives: 1 (minimization); constraints: 2171; variables: 5167; nonzeros (obj coefs + constraint coefs): 35674; reported optimal value: 1.2278423615E+05</description>
		<originalFileName>d2q06c.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>d2q06c.osil</osFileName>
	</instance>
	<instance>
		<name>D6CUBE</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Hughes</source>
		<description>objectives: 1 (minimization); constraints: 415; variables: 6184; nonzeros (obj coefs + constraint coefs): 43888; reported optimal value: 3.1549166667E+02. When solving the problem, MINOS 5.3 reports that 4223 out of 42417 steps (9.96%) are degenerate.
	Of this problem, Robert Hughes says, "Mike Anderson and I are working on the problem of finding the minimum cardinality of triangulations of the 6-dimensional cube.  The optimal objective value of the problem I sent you provides a lower bound for the cardinalities of all triangulations which contain a certain simplex of volume 8/6! and which contains the
centroid of the 6-cube in its interior.  The linear programming problem is not easily described." </description>
		<originalFileName>d6cube.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>d6cube.osil</osFileName>
	</instance>
	<instance>
		<name>DEGEN2</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by John Tomlin with the permission of Ketron.</source>
		<description>objectives: 1 (minimization); constraints: 444; variables: 534; nonzeros (obj coefs + constraint coefs): 4449; reported optimal value: -1.4351780000E+03. When solving the problem, MINOS 5.3 reports that 610 out of 1075 steps (56.74%) are degenerate.</description>
		<originalFileName>degen2.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>degen2.osil</osFileName>
	</instance>
	<instance>
		<name>DEGEN3</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by John Tomlin with the permission of Ketron.</source>
		<description>objectives: 1 (minimization); constraints: 1503; variables: 1818; nonzeros (obj coefs + constraint coefs): 26230; reported optimal value: -9.8729400000E+02. When solving the problem, MINOS 5.3 reports that 3299 out of 6283 steps (52.51%) are degenerate.</description>
		<originalFileName>degen3.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>degen3.osil</osFileName>
	</instance>
	<instance>
		<name>DFL001</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Marc Meketon</source>
		<description>objectives: 1 (minimization); constraints: 6071; variables: 12230; nonzeros (obj coefs + constraint coefs): 41873; reported optimal value: 1.12664E+07.  In converting the MPS file, Jun Ma filled the RHS section in the MPS file with dummy RHS labels. DFL001, says Marc Meketon, "is a 'real-world' airline schedule planning (fleet assignment) problem.  This LP was preprocessed by a modified version of the KORBX(r) System preprocessor.  The problem reduced in size (rows, columns, non-zeros) significantly.  The row and columns were randomly sorted and renamed, and a fixed adjustment to the objective function was eliminated.  The name of the problem is derived from the initials of the person who created it."
	On an IEEE-arithmetic machine (an SGI 4D/380S), David Gay succeeded in getting MINOS 5.3 to report optimal objective values, 1.1261702419E+07 and 1.1249281428E+07, for DFL001 only by starting with LOAD files derived from the solution obtained on the same machine by Bob Vanderbei's ALPO (an interior-point code); starting from one of the resulting "optimal" bases, MINOS ran 23914 iterations on a VAX before reporting an optimal value of 1.1253287141E+07.  When started from the same LOAD file used on the SGI machine, MINOS on the VAX reported an optimal value of 1.1255107696E+07.  Changing the FEASIBILITY TOLERANCE to 1.E-10 (from its default of 1.E-6) led MINOS on the SGI machine to report "optimal" values of 1.1266408461E+07 and 1.1266402835E+07.  This clearly is a problem where the FEASIBILITY TOLERANCE, initial basis, and floating-point arithmetic strongly affect the "optimal" solution that MINOS reports.  On the SGI machine, ALPO with SPLIT 3 found  
	primal:  obj value =  1.126639607e+07      FEASIBLE   ( 2.79e-09 )
	dual:    obj value =  1.126639604e+07      FEASIBLE   ( 1.39e-16 )	
	Bob Bixby reports the following about his experience solving DFL001 with CPLEX:
	First, the value for the objective function that I get running defaults is 1.1266396047e+07, with the following residuals:
	Max. unscaled (scaled) bound        infeas.: 4.61853e-14 (2.30926e-14)
	Max. unscaled (scaled) reduced-cost infeas.: 6.40748e-08 (6.40748e-08)  
	Max. unscaled (scaled) Ax-b          resid.: 4.28546e-14 (4.28546e-14)  
	Max. unscaled (scaled) c_B-B'pi      resid.: 8.00937e-08 (8.00937e-08)
	The L_infinity condition number of the (scaled) optimal basis is   213737.  I got exactly the same objective value solving the problem in several different ways.  I played a bit trying to get a better reduced-cost infeasibility, but that seems hopeless (if not pointless) given the c-Bpi residuals. Just as an aside, this problem exhibits very interesting behavior when solved using a simplex method.  I ran reduced-cost pricing on it in phase I, with the result that it took 465810 iterations to get feasible.  Running the default CPLEX pricing scheme, the entire problem solved in 94337 iterations (33059 in phase I) on a Sparcstation.  Steepest-edge pricing (and a different scaling) took 25803 iterations.  This is a nasty problem.</description>
		<originalFileName>dfl001.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>dfl001.osil</osFileName>
	</instance>
	<instance>
		<name>E226</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Michael Saunders from the Systems Optimization Laboratory at Stanford University.</source>
		<description>objectives: 1 (minimization); constraints: 223; variables: 282; nonzeros (obj coefs + constraint coefs): 2767; reported optimal value: -1.8751929066E+01. In converting the MPS file, Jun Ma treat  the RHS (-7.113) for the objective function ("...010 ") as an objective constant. Line 1683 in the mps file reads: ZZZZZZ01  ...000          -7.113   ...010           2.284.</description>
		<originalFileName>e226.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>e226.osil</osFileName>
	</instance>
	<instance>
		<name>ETAMACRO</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Michael Saunders from the Systems Optimization Laboratory at Stanford University.</source>
		<description>objectives: 1 (minimization); constraints: 400; variables: 688; nonzeros (obj coefs + constraint coefs): 2489; reported optimal value: -7.5571521774E+02</description>
		<originalFileName>etamacro.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>etamacro.osil</osFileName>
	</instance>
	<instance>
		<name>FFFFF800</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by John Reid on a tape sent to David Gay. </source>
		<description>objectives: 1 (minimization); constraints: 524; variables: 854; nonzeros (obj coefs + constraint coefs): 6235; reported optimal value: 5.5567961165E+05. This problem is sometimes called POWELL.</description>
		<originalFileName>fffff800.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>fffff800.osil</osFileName>
	</instance>
	<instance>
		<name>FINNIS</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Nick Gould from the Harwell collection of LP test problems.</source>
		<description>objectives: 1 (minimization); constraints: 497; variables: 614; nonzeros (obj coefs + constraint coefs):2714; reported optimal value: 1.7279096547E+05. According to Nick Gould, FINNIS "is from Mike Finnis at Harwell, a model for the selection of alternative fuel types."</description>
		<originalFileName>finnis.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>finnis.osil</osFileName>
	</instance>
	<instance>
		<name>FIT1D</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally created and supplied by Robert Fourer from Northwestern Univeristy.</source>
		<description>objectives: 1 (minimization); constraints: 24; variables: 1026; nonzeros (obj coefs + constraint coefs): 14430; reported optimal value: -9.1463780924E+03. Robert Fourer says: 
	The pairs FIT1P/FIT1D and FIT2P/FIT2D are primal and dual versions of the same two problems [except that we have negated the cost coefficients of the dual problems so all are minimization problems].  They originate from a model for fitting linear inequalities to data, by minimization of a sum of piecewise-linear penalties. The FIT1 problems are based on 627 data points and 2-3 pieces per primal pl penalty term.  The FIT2 problems are based on 3000 data points (from a different sample altogether) and 4-5 pieces per pl term.</description>
		<originalFileName>fit1d.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>fit1d.osil</osFileName>
	</instance>
	<instance>
		<name>FIT1P</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally created and supplied by Robert Fourer from Northwestern Univeristy.</source>
		<description>objectives: 1 (minimization); constraints: 627; variables: 1677; nonzeros (obj coefs + constraint coefs): 10894; reported optimal value: 9.1463780924E+03. Robert Fourer says: 
	The pairs FIT1P/FIT1D and FIT2P/FIT2D are primal and dual versions of the same two problems [except that we have negated the cost coefficients of the dual problems so all are minimization problems].  They originate from a model for fitting linear inequalities to data, by minimization of a sum of piecewise-linear penalties. The FIT1 problems are based on 627 data points and 2-3 pieces per primal pl penalty term.  The FIT2 problems are based on 3000 data points (from a different sample altogether) and 4-5 pieces per pl term.</description>
		<originalFileName>fit1p.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>fit1p.osil</osFileName>
	</instance>
	<instance>
		<name>FIT2D</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally created and supplied by Robert Fourer from Northwestern Univeristy.</source>
		<description>objectives: 1 (minimization); constraints: 26 cols:10500; nonzeros (obj coefs + constraint coefs): 138018; reported optimal value: -6.8464293294E+04. Robert Fourer says: 
	The pairs FIT1P/FIT1D and FIT2P/FIT2D are primal and dual versions of the same two problems [except that we have negated the cost coefficients of the dual problems so all are minimization problems].  They originate from a model for fitting linear inequalities to data, by minimization of a sum of piecewise-linear penalties. The FIT1 problems are based on 627 data points and 2-3 pieces per primal pl penalty term.  The FIT2 problems are based on 3000 data points (from a different sample altogether) and 4-5 pieces per pl term.</description>
		<originalFileName>fit2d.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>fit2d.osil</osFileName>
	</instance>
	<instance>
		<name>FIT2P</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally created and supplied by Robert Fourer from Northwestern Univeristy.</source>
		<description>objectives: 1 (minimization); constraints: 3000; variables: 13525; nonzeros (obj coefs + constraint coefs): 60784; reported optimal value: 6.8464293232E+04. Robert Fourer says: 
	The pairs FIT1P/FIT1D and FIT2P/FIT2D are primal and dual versions of the same two problems [except that we have negated the cost coefficients of the dual problems so all are minimization problems].  They originate from a model for fitting linear inequalities to data, by minimization of a sum of piecewise-linear penalties. The FIT1 problems are based on 627 data points and 2-3 pieces per primal pl penalty term.  The FIT2 problems are based on 3000 data points (from a different sample altogether) and 4-5 pieces per pl term.</description>
		<originalFileName>fit2p.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>fit2p.osil</osFileName>
	</instance>
	<instance>
		<name>FORPLAN</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of this problem is: John Mulvey, Princeton.</source>
		<description>objectives: 1 (minimization); constraints: 161; variables: 421; nonzeros (obj coefs + constraint coefs): 4916; reported optimal value: -6.6421873953E+02. In converting the MPS file, Jun Ma filled all the spaces in the variable and constraint names with dots (".")</description>
		<originalFileName>forplan.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>forplan.osil</osFileName>
	</instance>
	<instance>
		<name>GANGES</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Linus Schrage at Lindo Inc.</source>
		<description>objectives: 1 (minimization); constraints: 1309; variables: 1681; nonzeros (obj coefs + constraint coefs): 7021; reported optimal value: -1.0958636356E+05</description>
		<originalFileName>ganges.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>ganges.osil</osFileName>
	</instance>
	<instance>
		<name>GFRD-PNC</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of the problem is: R. Helgason, J. Kennington, and P. Wong, "An Application of Network Programming for National Forest Planning", Technical Report OR 81006, Dept. of Operations Research, Southern Methodist University.</source>
		<description>objectives: 1 (minimization); constraints: 616; variables: 1092; nonzeros (obj coefs + constraint coefs): 3467; reported optimal value: 6.9022359995E+06. In converting the MPS file, Jun Ma filled the RHS and BOUNDS sections in the MPS file with dummy RHS and Bound labels. </description>
		<originalFileName>gfrd-pnc.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>gfrd-pnc.osil</osFileName>
	</instance>
	<instance>
		<name>GREENBEA</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy.</source>
		<description>objectives: 1 (minimization); constraints: 2392; variables: 5405; nonzeros (obj coefs + constraint coefs): 31499; reported optimal value: -7.2462405908E+07. This problem differs from GREENBEB only in variable bounds.</description>
		<originalFileName>greenbea.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>greenbea.osil</osFileName>
	</instance>
	<instance>
		<name>GREENBEB</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy.</source>
		<description>objectives: 1 (minimization); constraints: 2392; variables: 5405; nonzeros (obj coefs + constraint coefs): 31499; reported optimal value: -4.3021476065E+06. This problem differs from GREENBEA only in variable bounds.</description>
		<originalFileName>greenbeb.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>greenbeb.osil</osFileName>
	</instance>
	<instance>
		<name>GROW15</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of the problem is: R. Fourer, "Solving Staircase Linear Programs by the Simplex Method, 2: Pricing", Math. Prog. 25 (1983), pp. 251-292. </source>
		<description>objectives: 1 (minimization); constraints: 300; variables: 645; nonzeros (obj coefs + constraint coefs): 5665; reported optimal value: -1.0687094129E+08.  In converting the MPS file, Jun Ma took away the 0 value RHS for the objective row. </description>
		<originalFileName>grow15.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>grow15.osil</osFileName>
	</instance>
	<instance>
		<name>GROW22</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of the problem is: R. Fourer, "Solving Staircase Linear Programs by the Simplex Method, 2: Pricing", Math. Prog. 25 (1983), pp. 251-292. </source>
		<description>objectives: 1 (minimization); constraints: 440; variables: 946; nonzeros (obj coefs + constraint coefs): 8318; reported optimal value: -1.6083433648E+08.  In converting the MPS file, Jun Ma took away the 0 value RHS for the objective row. </description>
		<originalFileName>grow22.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>grow22.osil</osFileName>
	</instance>
	<instance>
		<name>GROW7</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of the problem is: R. Fourer, "Solving Staircase Linear Programs by the Simplex Method, 2: Pricing", Math. Prog. 25 (1983), pp. 251-292. </source>
		<description>objectives: 1 (minimization); constraints: 140; variables: 301; nonzeros (obj coefs + constraint coefs): 2633; reported optimal value: -4.7787811815E+07.  In converting the MPS file, Jun Ma took away the 0 value RHS for the objective row. </description>
		<originalFileName>grow7.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>grow7.osil</osFileName>
	</instance>
	<instance>
		<name>ISRAEL</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Michael Saunders from the Systems Optimization Laboratory at Stanford University.</source>
		<description>objectives: 1 (minimization); constraints: 174; variables: 142; nonzeros (obj coefs + constraint coefs): 2358; reported optimal value: -8.9664482186E+05</description>
		<originalFileName>israel.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>israel.osil</osFileName>
	</instance>
	<instance>
		<name>KB2</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by John Tomlin with the permission of Ketron.</source>
		<description>objectives: 1 (minimization); constraints: 43; variables: 41; nonzeros (obj coefs + constraint coefs): 291; reported optimal value: -1.7499001299E+03. When solving the problem, MINOS 5.3 reports that 29 out of 82 steps (35.37%) are degenerate.	</description>
		<originalFileName>kb2.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>kb2.osil</osFileName>
	</instance>
	<instance>
		<name>LOTFI</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Vahid Lotfi.</source>
		<description>objectives: 1 (minimization); constraints: 153; variables: 308; nonzeros (obj coefs + constraint coefs): 1086; reported optimal value: -2.5264706062E+01. Vahid Lotfi says that LOTFI "involves audit staff scheduling.  This problem is semi real world and we have used it in a study, the results of which are to appear in Decision Sciences (Fall 1990).  The detailed description of the problem is also in the paper.  The problem is actually an MOLP with seven objectives, the first is maximization and the other six are minimization.  The version that I am sending has the aggregated objective (i.e., z1-z2-z3-z4-z5-z6-z7)."</description>
		<originalFileName>lotfi.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>lotfi.osil</osFileName>
	</instance>
	<instance>
		<name>MAROS</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Istvan Maros.</source>
		<description>objectives: 1 (minimization); constraints: 846; variables: 1443; nonzeros (obj coefs + constraint coefs): 10006; reported optimal value: -5.8063743701E+04. Istvan Maros says that MAROS is an industrial production/allocation model about which "the customer does not want to reveal the exact meaning".</description>
		<originalFileName>maros.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>maros.osil</osFileName>
	</instance>
	<instance>
		<name>MAROS-R7</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Istvan Maros.</source>
		<description>objectives: 1 (minimization); constraints: 3136; variables: 9408; nonzeros (obj coefs + constraint coefs): 151120; reported optimal value: 1.4971851665E+06.  Istvan Maros says that MAROS-R7 is "an interesting real-life LP problem which appeared hard to some solvers."  It "is an image restoration problem done via a goal programming approach.  It is structured, namely, its first section is a band matrix with the dominating number of nonzeros, while the second section is also a band matrix with bandwidth equals 2 and coefficients +1, -1.  The problem is a representative of a family of problems in which the number of rows and
the bandwidth of the first section can vary.  This one is a medium size problem from the family.  MAROS-R7 became available in cooperation with Roni Levkovitz and Carison Tong."</description>
		<originalFileName>maros-r7.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>maros-r7.osil</osFileName>
	</instance>
	<instance>
		<name>MODSZK1</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Istvan Maros.</source>
		<description>objectives: 1 (minimization); constraints: 687; variables: 1620; nonzeros (obj coefs + constraint coefs): 4158; reported optimal value: 3.2061972906E+02.  Istvan Maros says MODSZK1 is a "real-life problem" that is "very degenerate" and on which a dual simplex algorithm "may require up to 10 times" fewer iterations than a primal simplex algorithm.  It "is a multi-sector economic planning model (a kind of an input/output model in economy)" and "is an old problem of mine and it is not easy to recall more."</description>
		<originalFileName>modszk1.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>modszk1.osil</osFileName>
	</instance>
	<instance>
		<!-- possible warning
unprepared constrain type
unprepared constrain type
unprepared constrain type
unprepared constrain type
...
-->
		<name>NESM</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of this problem is: Gerald Brown, Naval Postgraduate School.</source>
		<description>objectives: 1 (minimization); constraints: 662; variables: 2923; nonzeros (obj coefs + constraint coefs): 13988; reported optimal value: 1.4076073035E+07</description>
		<originalFileName>nesm.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>nesm.osil</osFileName>
	</instance>
	<instance>
		<name>PEROLD</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Nick Gould from the Harwell collection of LP test problems.</source>
		<description>objectives: 1 (minimization); constraints: 625; variables: 1376; nonzeros (obj coefs + constraint coefs): 6026; reported optimal value: -9.3807580773E+03</description>
		<originalFileName>perold.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>perold.osil</osFileName>
	</instance>
	<instance>
		<name>PILOT</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Michael Saunders from the Systems Optimization Laboratory at Stanford University.</source>
		<description>objectives: 1 (minimization); constraints: 1441; variables: 3652; nonzeros (obj coefs + constraint coefs): 43220; reported optimal value: -5.5740430007E+02. Huanyuan (Wayne) Sheng solved the problem using CPLEX 9.0 on Redhad Linux (Enterprise). When solving the problem using the MPS input format, he obtained the result -557.4897062000. When solving the problem using the OSiL input format, he obtained the result -557.4884370000. There is a -1.2692000000E-03 (quite big) difference, which could be due to loss of accuracy in conversion. In comparing this problem (PILOT) and PILOT87,  Irv Lustig says, "PILOT87 is considered (by John Stone, at least) to be harder than PILOT because of the bad scaling in the numerics."</description>
		<originalFileName>pilot.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>pilot.osil</osFileName>
	</instance>
	<instance>
		<name>PILOT.JA</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of the problem is: SOL, Stanford University.</source>
		<description>objectives: 1 (minimization); constraints: 940; variables: 1988; nonzeros (obj coefs + constraint coefs): 14706; reported optimal value: -6113.1364660000. Huanyuan (Wayne) Sheng solved the problem using CPLEX 9.0 on Redhad Linux (Enterprise). When solving the problem using the MPS input format, he obtained the result -6113.1364660000. When solving the problem using the OSiL input format, he obtained the result -6113.1364650000. There is a -1.0000003385E-06 (fairly small) difference, which could be due to loss of accuracy in conversion. </description>
		<originalFileName>pilot.ja.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>pilot.ja.osil</osFileName>
	</instance>
	<instance>
		<name>PILOT.WE</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of the problem is: SOL, Stanford University.</source>
		<description>objectives: 1 (minimization); constraints: 722; variables: 2789; nonzeros (obj coefs + constraint coefs): 9218; reported optimal value: -2.7201027439E+06</description>
		<originalFileName>pilot.we.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>pilot.we.osil</osFileName>
	</instance>
	<instance>
		<name>PILOT4</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy.The source of the problem is: SOL, Stanford University.</source>
		<description>objectives: 1 (minimization); constraints: 410; variables: 1000; nonzeros (obj coefs + constraint coefs): 5145; reported optimal value: -2.5811392641E+03.  Huanyuan (Wayne) Sheng solved the problem using CPLEX 9.0 on Redhad Linux (Enterprise). When solving the problem using the MPS input format, he obtained the result -2581.1392610000. When solving the problem using the OSiL input format, he obtained the result -2581.1392600000. There is a -9.9999988379E-07 (fairly small) difference, which could be due to loss of accuracy in conversion. </description>
		<originalFileName>pilot4.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>pilot4.osil</osFileName>
	</instance>
	<instance>
		<name>PILOT87</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Irv Lustig, who obtained the problem from John Stone. </source>
		<description>objectives: 1 (minimization); constraints: 2030; variables: 4883; nonzeros (obj coefs + constraint coefs): 73804; reported optimal value: 3.0171072827E+02. Huanyuan (Wayne) Sheng solved the problem using CPLEX 9.0 on Redhad Linux (Enterprise). When solving the problem using the MPS input format, he obtained the result 301.7103473000. When solving the problem using the OSiL input format, he obtained the result 301.7115426000. There is a -1.1952999999E-03 (quite big) difference, which could be due to loss of accuracy in conversion.  Irv Lustig says, "PILOT87 is considered (by John Stone, at least) to be harder than PILOT because of the bad scaling in the numerics."</description>
		<originalFileName>pilot87.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>pilot87.osil</osFileName>
	</instance>
	<instance>
		<name>PILOTNOV</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of the problem is: SOL, Stanford University.</source>
		<description>objectives: 1 (minimization); constraints: 975; variables: 2172; nonzeros (obj coefs + constraint coefs): 13129; reported optimal value: -4.4972761882E+03</description>
		<originalFileName>pilotnov.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>pilotnov.osil</osFileName>
	</instance>
	<instance>
		<name>QAP8</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally from a generator by Terri Johnson, communicated by a combination of Bob Bixby, Matt Saltzman, and Terri Johnson. </source>
		<description>objectives: 1 (minimization); constraints: 912; variables: 1632; nonzeros (obj coefs + constraint coefs): 8304; reported optimal value: 2.0350000000E+02. This is an LP, representing a quadratic assignment problem.</description>
		<originalFileName>qap8.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>qap8.osil</osFileName>
	</instance>
	<instance>
		<name>QAP12</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally from a generator by Terri Johnson, communicated by a combination of Bob Bixby, Matt Saltzman, and Terri Johnson. </source>
		<description>objectives: 1 (minimization); constraints: 3192; variables: 8856; nonzeros (obj coefs + constraint coefs): 44244; reported optimal value: 5.2289435056E+02. This is an LP, representing a quadratic assignment problem.</description>
		<originalFileName>qap12.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>qap12.osil</osFileName>
	</instance>
	<instance>
		<name>QAP15</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally from a generator by Terri Johnson, communicated by a combination of Bob Bixby, Matt Saltzman, and Terri Johnson. </source>
		<description>objectives: 1 (minimization); constraints: 6330; variables: 22275; nonzeros (obj coefs + constraint coefs): 110700; reported optimal value: 1.0409940410E+03. This is an LP, representing a quadratic assignment problem.</description>
		<originalFileName>qap15.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>qap15.osil</osFileName>
	</instance>
	<instance>
		<name>RECIPE</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy through consulting. </source>
		<description>objectives: 1 (minimization); constraints: 91; variables: 180; nonzeros (obj coefs + constraint coefs): 752; reported optimal value: -2.6661600000E+02</description>
		<originalFileName>recipe.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>recipe.osil</osFileName>
	</instance>
	<instance>
		<name>SC105</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Nick Gould from the Harwell collection of LP test problems.</source>
		<description>objectives: 1 (minimization); constraints: 105; variables: 103; nonzeros (obj coefs + constraint coefs): 281; reported optimal value: -5.2202061212E+01</description>
		<originalFileName>sc105.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>sc105.osil</osFileName>
	</instance>
	<instance>
		<name>SC205</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of the problem is: J.K. Ho and E. Loute, "A Set of Staircase Linear Programming Test Problems", Math. Prog. 20 (1981), pp. 245-250.</source>
		<description>objectives: 1 (minimization); constraints: 205; variables: 203; nonzeros (obj coefs + constraint coefs): 552; reported optimal value: -5.2202061212E+01</description>
		<originalFileName>sc205.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>sc205.osil</osFileName>
	</instance>
	<instance>
		<name>SC50A</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Nick Gould from the Harwell collection of LP test problems.</source>
		<description>objectives: 1 (minimization); constraints: 50; variables: 48; nonzeros (obj coefs + constraint coefs): 131; reported optimal value: -6.4575077059E+01</description>
		<originalFileName>sc50a.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>sc50a.osil</osFileName>
	</instance>
	<instance>
		<name>SC50B</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Nick Gould from the Harwell collection of LP test problems.</source>
		<description>objectives: 1 (minimization); constraints: 50; variables: 48; nonzeros (obj coefs + constraint coefs): 119; reported optimal value: -7.0000000000E+01	</description>
		<originalFileName>sc50b.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>sc50b.osil</osFileName>
	</instance>
	<instance>
		<name>SCAGR25</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of the problem is: J.K. Ho and E. Loute, "A Set of Staircase Linear Programming Test Problems", Math. Prog. 20 (1981), pp. 245-250.</source>
		<description>objectives: 1 (minimization); constraints: 471; variables: 500; nonzeros (obj coefs + constraint coefs): 2029; reported optimal value: -1.4753433061E+07</description>
		<originalFileName>scagr25.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>scagr25.osil</osFileName>
	</instance>
	<instance>
		<name>SCAGR7</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of the problem is: J.K. Ho and E. Loute, "A Set of Staircase Linear Programming Test Problems", Math. Prog. 20 (1981), pp. 245-250.</source>
		<description>objectives: 1 (minimization); constraints: 129; variables: 140; nonzeros (obj coefs + constraint coefs): 553; reported optimal value: -2.3313892548E+06</description>
		<originalFileName>scagr7.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>scagr7.osil</osFileName>
	</instance>
	<instance>
		<name>SCFXM1</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of the problem is: J.K. Ho and E. Loute, "A Set of Staircase Linear Programming Test Problems", Math. Prog. 20 (1981), pp. 245-250.</source>
		<description>objectives: 1 (minimization); constraints: 330; variables: 457; nonzeros (obj coefs + constraint coefs): 2612; reported optimal value: 1.8416759028E+04</description>
		<originalFileName>scfxm1.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>scfxm1.osil</osFileName>
	</instance>
	<instance>
		<name>SCFXM2</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of the problem is: J.K. Ho and E. Loute, "A Set of Staircase Linear Programming Test Problems", Math. Prog. 20 (1981), pp. 245-250.</source>
		<description>objectives: 1 (minimization); constraints: 660; variables: 914; nonzeros (obj coefs + constraint coefs): 5229; reported optimal value: 3.6660261565E+04</description>
		<originalFileName>scfxm2.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>scfxm2.osil</osFileName>
	</instance>
	<instance>
		<name>SCFXM3</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of the problem is: J.K. Ho and E. Loute, "A Set of Staircase Linear Programming Test Problems", Math. Prog. 20 (1981), pp. 245-250.</source>
		<description>objectives: 1 (minimization); constraints: 990; variables: 1371; nonzeros (obj coefs + constraint coefs): 7846; reported optimal value: 5.4901254550E+04</description>
		<originalFileName>scfxm3.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>scfxm3.osil</osFileName>
	</instance>
	<instance>
		<name>SCORPION</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of the problem is: J.K. Ho and E. Loute, "A Set of Staircase Linear Programming Test Problems", Math. Prog. 20 (1981), pp. 245-250.</source>
		<description>objectives: 1 (minimization); constraints: 388; variables: 358; nonzeros (obj coefs + constraint coefs): 17085; reported optimal value: 1.8781248227E+03</description>
		<originalFileName>scorpion.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>scorpion.osil</osFileName>
	</instance>
	<instance>
		<name>SCRS8</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of the problem is: J.K. Ho and E. Loute, "A Set of Staircase Linear Programming Test Problems", Math. Prog. 20 (1981), pp. 245-250.</source>
		<description>objectives: 1 (minimization); constraints: 490; variables: 1169; nonzeros (obj coefs + constraint coefs): 4029; reported optimal value: 9.0429998619E+02</description>
		<originalFileName>scrs8.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>scrs8.osil</osFileName>
	</instance>
	<instance>
		<name>SCSD1</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of the problem is: J.K. Ho and E. Loute, "A Set of Staircase Linear Programming Test Problems", Math. Prog. 20 (1981), pp. 245-250.</source>
		<description>objectives: 1 (minimization); constraints: 77; variables: 760; nonzeros (obj coefs + constraint coefs): 3148; reported optimal value: 8.6666666743E+00</description>
		<originalFileName>scsd1.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>scsd1.osil</osFileName>
	</instance>
	<instance>
		<name>SCSD6</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of the problem is: J.K. Ho and E. Loute, "A Set of Staircase Linear Programming Test Problems", Math. Prog. 20 (1981), pp. 245-250.</source>
		<description>objectives: 1 (minimization); constraints: 147; variables: 1350; nonzeros (obj coefs + constraint coefs): 5666; reported optimal value: 5.0500000078E+01</description>
		<originalFileName>scsd6.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>scsd6.osil</osFileName>
	</instance>
	<instance>
		<name>SCSD8</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of the problem is: J.K. Ho and E. Loute, "A Set of Staircase Linear Programming Test Problems", Math. Prog. 20 (1981), pp. 245-250.</source>
		<description>objectives: 1 (minimization); constraints: 397; variables: 2750; nonzeros (obj coefs + constraint coefs): 11334; reported optimal value: 9.0499999993E+02</description>
		<originalFileName>scsd8.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>scsd8.osil</osFileName>
	</instance>
	<instance>
		<name>SCTAP1</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of the problem is: J.K. Ho and E. Loute, "A Set of Staircase Linear Programming Test Problems", Math. Prog. 20 (1981), pp. 245-250.</source>
		<description>objectives: 1 (minimization); constraints: 300; variables: 480; nonzeros (obj coefs + constraint coefs): 2052; reported optimal value: 1.4122500000E+03</description>
		<originalFileName>sctap1.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>sctap1.osil</osFileName>
	</instance>
	<instance>
		<name>SCTAP2</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of the problem is: J.K. Ho and E. Loute, "A Set of Staircase Linear Programming Test Problems", Math. Prog. 20 (1981), pp. 245-250.</source>
		<description>objectives: 1 (minimization); constraints: 1090; variables: 1880; nonzeros (obj coefs + constraint coefs): 8124; reported optimal value: 1.7248071429E+03</description>
		<originalFileName>sctap2.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>sctap2.osil</osFileName>
	</instance>
	<instance>
		<name>SCTAP3</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of the problem is: J.K. Ho and E. Loute, "A Set of Staircase Linear Programming Test Problems", Math. Prog. 20 (1981), pp. 245-250.</source>
		<description>objectives: 1 (minimization); constraints: 1480; variables: 2480; nonzeros (obj coefs + constraint coefs): 10734; reported optimal value: 78688</description>
		<originalFileName>sctap3.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>sctap3.osil</osFileName>
	</instance>
	<instance>
		<!-- possible warning
unprepared constrain type
unprepared constrain type
unprepared constrain type
unprepared constrain type
...
-->
		<name>SEBA</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Linus Schrage at Lindo Inc.</source>
		<description>objectives: 1 (minimization); constraints: 515; variables: 1028; nonzeros (obj coefs + constraint coefs): 4874; reported optimal value: 1.5711600000E+04</description>
		<originalFileName>seba.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>seba.osil</osFileName>
	</instance>
	<instance>
		<name>SHARE1B</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Michael Saunders from the Systems Optimization Laboratory at Stanford University.</source>
		<description>objectives: 1 (minimization); constraints: 117; variables: 225; nonzeros (obj coefs + constraint coefs): 1182; reported optimal value: -7.6589318579E+04</description>
		<originalFileName>share1b.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>share1b.osil</osFileName>
	</instance>
	<instance>
		<name>SHARE2B</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Michael Saunders from the Systems Optimization Laboratory at Stanford University.</source>
		<description>objectives: 1 (minimization); constraints: 96; variables: 79; nonzeros (obj coefs + constraint coefs): 730; reported optimal value: -4.1573224074E+02</description>
		<originalFileName>share2b.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>share2b.osil</osFileName>
	</instance>
	<instance>
		<name>SHELL</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by John Reid on a tape sent to David Gay. </source>
		<description>objectives: 1 (minimization); constraints: 536; variables: 1775; nonzeros (obj coefs + constraint coefs): 4900; reported optimal value: 1.2088253460E+09</description>
		<originalFileName>shell.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>shell.osil</osFileName>
	</instance>
	<instance>
		<name>SHIP04L</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy through consulting.</source>
		<description>objectives: 1 (minimization); constraints: 402; variables: 2118; nonzeros (obj coefs + constraint coefs): 8450; reported optimal value: 1.7933245380E+06</description>
		<originalFileName>ship04l.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>ship04l.osil</osFileName>
	</instance>
	<instance>
		<name>SHIP04S</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy through consulting.</source>
		<description>objectives: 1 (minimization); constraints: 402; variables: 1458; nonzeros (obj coefs + constraint coefs): 5810; reported optimal value: 1.7987147004E+06</description>
		<originalFileName>ship04s.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>ship04s.osil</osFileName>
	</instance>
	<instance>
		<name>SHIP08L</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy through consulting.</source>
		<description>objectives: 1 (minimization); constraints: 778; variables: 4283; nonzeros (obj coefs + constraint coefs): 1708; reported optimal value: 1.9090552114E+06</description>
		<originalFileName>ship08l.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>ship08l.osil</osFileName>
	</instance>
	<instance>
		<name>SHIP08S</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy through consulting.</source>
		<description>objectives: 1 (minimization); constraints: 778; variables: 2387; nonzeros (obj coefs + constraint coefs): 9501; reported optimal value: 1.9200982105E+06</description>
		<originalFileName>ship08s.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>ship08s.osil</osFileName>
	</instance>
	<instance>
		<name>SHIP12L</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy through consulting.</source>
		<description>objectives: 1 (minimization); constraints: 1151; variables: 5427; nonzeros (obj coefs + constraint coefs): 21597; reported optimal value: 1.4701879193E+06</description>
		<originalFileName>ship12l.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>ship12l.osil</osFileName>
	</instance>
	<instance>
		<name>SHIP12S</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy through consulting.</source>
		<description>objectives: 1 (minimization); constraints: 1151; variables: 2763; nonzeros (obj coefs + constraint coefs): 10941; reported optimal value: 1.4892361344E+06</description>
		<originalFileName>ship12s.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>ship12s.osil</osFileName>
	</instance>
	<instance>
		<name>SIERRA</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy. The source of the problem is: R. Helgason, J. Kennington, and P. Wong, "An Application of Network Programming for National Forest Planning", Technical Report OR 81006, Dept. of Operations Research, Southern Methodist University.</source>
		<description>objectives: 1 (minimization); constraints: 1227; variables: 2036; nonzeros (obj coefs + constraint coefs): 9252; reported optimal value: 1.5394362184E+07.  In converting the MPS file, Jun Ma filled the RHS and BOUNDS sections in the MPS file with dummy RHS and Bound labels. </description>
		<originalFileName>sierra.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>sierra.osil</osFileName>
	</instance>
	<instance>
		<name>STAIR</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Michael Saunders from the Systems Optimization Laboratory at Stanford University.</source>
		<description>objectives: 1 (minimization); constraints: 356; variables: 467; nonzeros (obj coefs + constraint coefs): 3857; reported optimal value: -2.5126695119E+02</description>
		<originalFileName>stair.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>stair.osil</osFileName>
	</instance>
	<instance>
		<name>STANDATA</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy through consulting. </source>
		<description>objectives: 1 (minimization); constraints: 359; variables: 1075; nonzeros (obj coefs + constraint coefs): 3038; reported optimal value: 1.2576995000E+03</description>
		<originalFileName>standata.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>standata.osil</osFileName>
	</instance>
	<instance>
		<name>STANDGUB</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy through consulting.</source>
		<description>objectives: 1 (minimization); constraints: 361; variables: 1184; nonzeros (obj coefs + constraint coefs): 3147; reported optimal value: SEE NEXT. STANDGUB includes GUB markers; with these lines removed (lines in the expanded MPS file that contain primes, i.e., that mention the rows 'EGROUP' and 'ENDX'), STANDGUB becomes the same as problem STANDATA;
MINOS does not understand the GUB markers, so we cannot report an optimal value from MINOS for STANDGUB.  STANDMPS amounts to STANDGUB with the GUB constraints as explicit constraints.</description>
		<originalFileName>standgub.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>standgub.osil</osFileName>
	</instance>
	<instance>
		<name>STANDMPS</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy through consulting.</source>
		<description>objectives: 1 (minimization); constraints: 467; variables: 1075; nonzeros (obj coefs + constraint coefs): 3686; reported optimal value: 1.4060175000E+03</description>
		<originalFileName>standmps.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>standmps.osil</osFileName>
	</instance>
	<instance>
		<name>STOCFOR1</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Gus Gassmann.</source>
		<description>objectives: 1 (minimization); constraints: 117; variables: 111; nonzeros (obj coefs + constraint coefs): 474; reported optimal value: -4.1131976219E+04. STOCFOR1,2,3 are stochastic forestry problems from Gus Gassmann.  To quote Gus, "All of them are seven-period descriptions of a forestry problem with a random occurrence of forest fires, and the size varies according to the number of realizations you use in each period." STOCFOR1 "is the deterministic version, STOCFOR2 has 2 realizations each in periods 2 to 7, and the monster STOCFOR3 has 4,4,4,2,2, and 2 realizations, respectively."  The compressed form of STOCFOR3 would be 652846 bytes long, so requesting STOCFOR3 will instead get you a bundle of about 174 kilobytes that includes source for Gus's program, the data files for generating STOCFOR3 and a summary of "A Standard Input Format for Multistage Stochastic Linear Programs" by J.R. Birge, M.A.H. Dempster, H.I. Gassmann, E.A. Gunn, A.J. King, and S.W. Wallace [COAL Newsletter No. 17 (Dec. 1987), pp. 1-19].  Data files are also included for generating versions of STOCFOR1,2 that have more decimal places than the versions in lp/data.</description>
		<originalFileName>stocfor1.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>stocfor1.osil</osFileName>
	</instance>
	<instance>
		<name>STOCFOR2</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Gus Gassmann.</source>
		<description>objectives: 1 (minimization); constraints: 2157; variables: 2031; nonzeros (obj coefs + constraint coefs): 9492; reported optimal value: -3.9024408538E+04. STOCFOR1,2,3 are stochastic forestry problems from Gus Gassmann.  To quote Gus, "All of them are seven-period descriptions of a forestry problem with a random occurrence of forest fires, and the size varies according to the number of realizations you use in each period." STOCFOR1 "is the deterministic version, STOCFOR2 has 2 realizations each in periods 2 to 7, and the monster STOCFOR3 has 4,4,4,2,2, and 2 realizations, respectively."  The compressed form of STOCFOR3 would be 652846 bytes long, so requesting STOCFOR3 will instead get you a bundle of about 174 kilobytes that includes source for Gus's program, the data files for generating STOCFOR3 and a summary of "A Standard Input Format for Multistage Stochastic Linear Programs" by J.R. Birge, M.A.H. Dempster, H.I. Gassmann, E.A. Gunn, A.J. King, and S.W. Wallace [COAL Newsletter No. 17 (Dec. 1987), pp. 1-19].  Data files are also included for generating versions of STOCFOR1,2 that have more decimal places than the versions in lp/data.</description>
		<originalFileName>stocfor2.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>stocfor2.osil</osFileName>
	</instance>
	<instance>
		<name>STOCFOR3</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Gus Gassmann.</source>
		<description>objectives: 1 (minimization); constraints: 16675; variables: 15695; nonzeros (obj coefs + constraint coefs): 74004; reported optimal value: -3.9976661576E+04. STOCFOR1,2,3 are stochastic forestry problems from Gus Gassmann.  To quote Gus, "All of them are seven-period descriptions of a forestry problem with a random occurrence of forest fires, and the size varies according to the number of realizations you use in each period." STOCFOR1 "is the deterministic version, STOCFOR2 has 2 realizations each in periods 2 to 7, and the monster STOCFOR3 has 4,4,4,2,2, and 2 realizations, respectively."  The compressed form of STOCFOR3 would be 652846 bytes long, so requesting STOCFOR3 will instead get you a bundle of about 174 kilobytes that includes source for Gus's program, the data files for generating STOCFOR3 and a summary of "A Standard Input Format for Multistage Stochastic Linear Programs" by J.R. Birge, M.A.H. Dempster, H.I. Gassmann, E.A. Gunn, A.J. King, and S.W. Wallace [COAL Newsletter No. 17 (Dec. 1987), pp. 1-19].  Data files are also included for generating versions of STOCFOR1,2 that have more decimal places than the versions in lp/data.</description>
		<originalFileName>stocfor3.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>stocfor3.osil</osFileName>
	</instance>
	<instance>
		<name>TRUSS</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Rudy Setiono at the request of Olvi Mangasarian.</source>
		<description>objectives: 1 (minimization); constraints: 1000; variables: 8806; nonzeros (obj coefs + constraint coefs): 36642; reported optimal value: 4.5881584719E+05. This is a problem of minimizing the weight of a certain structure.</description>
		<originalFileName>truss.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>truss.osil</osFileName>
	</instance>
	<instance>
		<name>TUFF</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by John Tomlin with the permission of Ketron.</source>
		<description>objectives: 1 (minimization); constraints: 333; variables: 587; nonzeros (obj coefs + constraint coefs): 4523; reported optimal value: 2.9214776509E-01. When solving the problem, MINOS 5.3 reports that 345 out of 745 steps (46.31%) are degenerate.</description>
		<originalFileName>tuff.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>tuff.osil</osFileName>
	</instance>
	<instance>
		<name>VTP.BASE</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by Robert Fourer from Northwestern Univeristy through consulting.</source>
		<description>objectives: 1 (minimization); constraints: 198; variables: 203; nonzeros (obj coefs + constraint coefs): 914; reported optimal value: 1.2983146246E+05</description>
		<originalFileName>vtp.base.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>vtp.base.osil</osFileName>
	</instance>
	<instance>
		<name>WOOD1P</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by John Tomlin with the permission of Ketron.</source>
		<description>objectives: 1 (minimization); constraints: 244; variables: 2594; nonzeros (obj coefs + constraint coefs): 70216; reported optimal value: 1.4429024116E+00. When solving the problem, MINOS 5.3 reports that 471 out of 1059 steps (44.48%) are degenerate.</description>
		<originalFileName>wood1p.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>wood1p.osil</osFileName>
	</instance>
	<instance>
		<name>WOODW</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by John Tomlin with the permission of Ketron.</source>
		<description>objectives: 1 (minimization); constraints: 1098; variables: 8405; nonzeros (obj coefs + constraint coefs): 37478; reported optimal value: 1.3044763331E+00. When solving the problem, MINOS 5.3 reports that 1604 out of 4147 steps (38.68%) are degenerate.</description>
		<originalFileName>woodw.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>woodw.osil</osFileName>
	</instance>
	<!--- Kennington Problems-->
	<instance>
		<name>CRE-A</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the "Kennington" problems in the Netlib Repository. 
		"Kennington" problems are described in "An Empirical Evaluation of the KORBX Algorithms for Military Airlift Applications" by W. J. Carolan, J. E. Hill, J. L. Kennington, S. Niemi, S. J. Wichmann (Operations Research vol. 38, no. 2 (1990), pp. 240-248).	
		</source>
		<description>objectives: 1 (minimization); constraints: 3516; variables: 4067; nonzeros (obj coefs + constraint coefs): 19054; reported optimal value: 2.3595407e+07</description>
		<originalFileName>cre-a.mps</originalFileName>
		<osDirectoty>linear/continuous/Kennington/</osDirectoty>
		<osFileName>cre-a.osil</osFileName>
	</instance>
	<instance>
		<name>CRE-B</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the "Kennington" problems in the Netlib Repository. 
		"Kennington" problems are described in "An Empirical Evaluation of the KORBX Algorithms for Military Airlift Applications" by W. J. Carolan, J. E. Hill, J. L. Kennington, S. Niemi, S. J. Wichmann (Operations Research vol. 38, no. 2 (1990), pp. 240-248).	
		</source>
		<description>objectives: 1 (minimization); constraints: 9648; variables: 72447; nonzeros (obj coefs + constraint coefs): 328542; reported optimal value: 2.3129640e+07</description>
		<originalFileName>cre-b.mps</originalFileName>
		<osDirectoty>linear/continuous/Kennington/</osDirectoty>
		<osFileName>cre-b.osil</osFileName>
	</instance>
	<instance>
		<name>CRE-C</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the "Kennington" problems in the Netlib Repository. 
		"Kennington" problems are described in "An Empirical Evaluation of the KORBX Algorithms for Military Airlift Applications" by W. J. Carolan, J. E. Hill, J. L. Kennington, S. Niemi, S. J. Wichmann (Operations Research vol. 38, no. 2 (1990), pp. 240-248).	
		</source>
		<description>objectives: 1 (minimization); constraints: 3068; variables: 3678; nonzeros (obj coefs + constraint coefs): 16922; reported optimal value: 2.5275116e+07</description>
		<originalFileName>cre-c.mps</originalFileName>
		<osDirectoty>linear/continuous/Kennington/</osDirectoty>
		<osFileName>cre-c.osil</osFileName>
	</instance>
	<instance>
		<name>CRE-D</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the "Kennington" problems in the Netlib Repository. 
		"Kennington" problems are described in "An Empirical Evaluation of the KORBX Algorithms for Military Airlift Applications" by W. J. Carolan, J. E. Hill, J. L. Kennington, S. Niemi, S. J. Wichmann (Operations Research vol. 38, no. 2 (1990), pp. 240-248).	
		</source>
		<description>objectives: 1 (minimization); constraints: 8926; variables: 69980; nonzeros (obj coefs + constraint coefs): 312626; reported optimal value: 2.4454970e+07</description>
		<originalFileName>cre-d.mps</originalFileName>
		<osDirectoty>linear/continuous/Kennington/</osDirectoty>
		<osFileName>cre-d.osil</osFileName>
	</instance>
	<instance>
		<name>KEN-07</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the "Kennington" problems in the Netlib Repository. 
		"Kennington" problems are described in "An Empirical Evaluation of the KORBX Algorithms for Military Airlift Applications" by W. J. Carolan, J. E. Hill, J. L. Kennington, S. Niemi, S. J. Wichmann (Operations Research vol. 38, no. 2 (1990), pp. 240-248).	
		</source>
		<description>objectives: 1 (minimization); constraints: 2426; variables: 3602; nonzeros (obj coefs + constraint coefs): 11981; reported optimal value: -6.7952044e+08</description>
		<originalFileName>ken-07.mps</originalFileName>
		<osDirectoty>linear/continuous/Kennington/</osDirectoty>
		<osFileName>ken-07.osil</osFileName>
	</instance>
	<instance>
		<name>KEN-11</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the "Kennington" problems in the Netlib Repository. 
		"Kennington" problems are described in "An Empirical Evaluation of the KORBX Algorithms for Military Airlift Applications" by W. J. Carolan, J. E. Hill, J. L. Kennington, S. Niemi, S. J. Wichmann (Operations Research vol. 38, no. 2 (1990), pp. 240-248).	
		</source>
		<description>objectives: 1 (minimization); constraints: 14694; variables: 21349; nonzeros (obj coefs + constraint coefs): 70354; reported optimal value: -6.9723823e+09</description>
		<originalFileName>ken-11.mps</originalFileName>
		<osDirectoty>linear/continuous/Kennington/</osDirectoty>
		<osFileName>ken-11.osil</osFileName>
	</instance>
	<instance>
		<name>KEN-13</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the "Kennington" problems in the Netlib Repository. 
		"Kennington" problems are described in "An Empirical Evaluation of the KORBX Algorithms for Military Airlift Applications" by W. J. Carolan, J. E. Hill, J. L. Kennington, S. Niemi, S. J. Wichmann (Operations Research vol. 38, no. 2 (1990), pp. 240-248).	
		</source>
		<description>objectives: 1 (minimization); constraints: 28632; variables: 42659; nonzeros (obj coefs + constraint coefs): 139834; reported optimal value: -1.0257395e+10</description>
		<originalFileName>ken-13.mps</originalFileName>
		<osDirectoty>linear/continuous/Kennington/</osDirectoty>
		<osFileName>ken-13.osil</osFileName>
	</instance>
	<instance>
		<name>KEN-18</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the "Kennington" problems in the Netlib Repository. 
		"Kennington" problems are described in "An Empirical Evaluation of the KORBX Algorithms for Military Airlift Applications" by W. J. Carolan, J. E. Hill, J. L. Kennington, S. Niemi, S. J. Wichmann (Operations Research vol. 38, no. 2 (1990), pp. 240-248).	
		</source>
		<description>objectives: 1 (minimization); constraints: 105127; variables: 154699; nonzeros (obj coefs + constraint coefs): 512719; reported optimal value: -5.2217025e+10</description>
		<originalFileName>ken-18.mps</originalFileName>
		<osDirectoty>linear/continuous/Kennington/</osDirectoty>
		<osFileName>ken-18.osil</osFileName>
	</instance>
	<instance>
		<name>OSA-07</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the "Kennington" problems in the Netlib Repository. 
		"Kennington" problems are described in "An Empirical Evaluation of the KORBX Algorithms for Military Airlift Applications" by W. J. Carolan, J. E. Hill, J. L. Kennington, S. Niemi, S. J. Wichmann (Operations Research vol. 38, no. 2 (1990), pp. 240-248).	
		</source>
		<description>objectives: 1 (minimization); constraints: 1118; variables: 23949; nonzeros (obj coefs + constraint coefs): 167643; reported optimal value: 5.3572252e+05</description>
		<originalFileName>osa-07.mps</originalFileName>
		<osDirectoty>linear/continuous/Kennington/</osDirectoty>
		<osFileName>osa-07.osil</osFileName>
	</instance>
	<instance>
		<name>OSA-14</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the "Kennington" problems in the Netlib Repository. 
		"Kennington" problems are described in "An Empirical Evaluation of the KORBX Algorithms for Military Airlift Applications" by W. J. Carolan, J. E. Hill, J. L. Kennington, S. Niemi, S. J. Wichmann (Operations Research vol. 38, no. 2 (1990), pp. 240-248).	
		</source>
		<description>objectives: 1 (minimization); constraints: 2337; variables: 52460; nonzeros (obj coefs + constraint coefs): 367220; reported optimal value: 1.1064628e+06</description>
		<originalFileName>osa-14.mps</originalFileName>
		<osDirectoty>linear/continuous/Kennington/</osDirectoty>
		<osFileName>osa-14.osil</osFileName>
	</instance>
	<instance>
		<name>OSA-30</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the "Kennington" problems in the Netlib Repository. 
		"Kennington" problems are described in "An Empirical Evaluation of the KORBX Algorithms for Military Airlift Applications" by W. J. Carolan, J. E. Hill, J. L. Kennington, S. Niemi, S. J. Wichmann (Operations Research vol. 38, no. 2 (1990), pp. 240-248).	
		</source>
		<description>objectives: 1 (minimization); constraints: 4350; variables: 100024; nonzeros (obj coefs + constraint coefs): 700160; reported optimal value: 2.1421399e+06</description>
		<originalFileName>osa-30.mps</originalFileName>
		<osDirectoty>linear/continuous/Kennington/</osDirectoty>
		<osFileName>osa-30.osil</osFileName>
	</instance>
	<instance>
		<name>OSA-60</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the "Kennington" problems in the Netlib Repository. 
		"Kennington" problems are described in "An Empirical Evaluation of the KORBX Algorithms for Military Airlift Applications" by W. J. Carolan, J. E. Hill, J. L. Kennington, S. Niemi, S. J. Wichmann (Operations Research vol. 38, no. 2 (1990), pp. 240-248).	
		</source>
		<description>objectives: 1 (minimization); constraints: 10280; variables: 232966; nonzeros (obj coefs + constraint coefs): 1630758; reported optimal value: 4.0440725e+06</description>
		<originalFileName>osa-60.mps</originalFileName>
		<osDirectoty>linear/continuous/Kennington/</osDirectoty>
		<osFileName>osa-60.osil</osFileName>
	</instance>
	<instance>
		<name>PDS-02</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the "Kennington" problems in the Netlib Repository. 
		"Kennington" problems are described in "An Empirical Evaluation of the KORBX Algorithms for Military Airlift Applications" by W. J. Carolan, J. E. Hill, J. L. Kennington, S. Niemi, S. J. Wichmann (Operations Research vol. 38, no. 2 (1990), pp. 240-248).	
		</source>
		<description>objectives: 1 (minimization); constraints: 2953; variables: 7535; nonzeros (obj coefs + constraint coefs): 21252; reported optimal value: 2.8857862e+10</description>
		<originalFileName>pds-02.mps</originalFileName>
		<osDirectoty>linear/continuous/Kennington/</osDirectoty>
		<osFileName>pds-02.osil</osFileName>
	</instance>
	<instance>
		<name>PDS-06</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the "Kennington" problems in the Netlib Repository. 
		"Kennington" problems are described in "An Empirical Evaluation of the KORBX Algorithms for Military Airlift Applications" by W. J. Carolan, J. E. Hill, J. L. Kennington, S. Niemi, S. J. Wichmann (Operations Research vol. 38, no. 2 (1990), pp. 240-248).	
		</source>
		<description>objectives: 1 (minimization); constraints: 9881; variables: 28655; nonzeros (obj coefs + constraint coefs): 82269; reported optimal value: 2.7761038e+10</description>
		<originalFileName>pds-06.mps</originalFileName>
		<osDirectoty>linear/continuous/Kennington/</osDirectoty>
		<osFileName>pds-06.osil</osFileName>
	</instance>
	<instance>
		<name>PDS-10</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the "Kennington" problems in the Netlib Repository. 
		"Kennington" problems are described in "An Empirical Evaluation of the KORBX Algorithms for Military Airlift Applications" by W. J. Carolan, J. E. Hill, J. L. Kennington, S. Niemi, S. J. Wichmann (Operations Research vol. 38, no. 2 (1990), pp. 240-248).	
		</source>
		<description>objectives: 1 (minimization); constraints: 16558; variables: 48763; nonzeros (obj coefs + constraint coefs): 140063; reported optimal value: 2.6727095e+10</description>
		<originalFileName>pds-10.mps</originalFileName>
		<osDirectoty>linear/continuous/Kennington/</osDirectoty>
		<osFileName>pds-10.osil</osFileName>
	</instance>
	<instance>
		<name>PDS-20</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the "Kennington" problems in the Netlib Repository. 
		"Kennington" problems are described in "An Empirical Evaluation of the KORBX Algorithms for Military Airlift Applications" by W. J. Carolan, J. E. Hill, J. L. Kennington, S. Niemi, S. J. Wichmann (Operations Research vol. 38, no. 2 (1990), pp. 240-248).	
		</source>
		<description>objectives: 1 (minimization); constraints: 33874; variables: 105728; nonzeros (obj coefs + constraint coefs): 304153; reported optimal value: 2.3821659e+10</description>
		<originalFileName>pds-20.mps</originalFileName>
		<osDirectoty>linear/continuous/Kennington/</osDirectoty>
		<osFileName>pds-20.osil</osFileName>
	</instance>
	<!-- Infeasible Problems-->
	<instance>
		<name>BGDBG1</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University. Contributor:  Linus Schrage, University of Chicago and LINDO Systems Inc.</source>
		<description>objectives: 1 (minimization); constraints: 348; variables: 407; nonzeros 1485:; reported optimal value: Infeasible. BGDBG1 is a medium problem that was originally an integer program for a plant operation model. Infeasibility is original.  </description>
		<originalFileName>bgdbg1.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>bgdbg1.osil</osFileName>
	</instance>
	<instance>
		<name>BGETAM</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University. Contributor:  Linus Schrage, University of Chicago and LINDO Systems Inc.</source>
		<description>objectives: 1 (minimization); constraints: 400; variables:688; nonzeros (obj coefs + constraint coefs): 2489; reported optimal value: Infeasible. BGETAM is a medium model that is a version of the ETAMACRO test problem in which one right hand side has been altered to make it infeasible. </description>
		<originalFileName>bgetam.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>bgetam.osil</osFileName>
	</instance>
	<instance>
		<name>BGINDY</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University. Contributor:  Linus Schrage, University of Chicago and LINDO Systems Inc.</source>
		<description>objectives: 1 (minimization); constraints: 2671; variables: 10116; nonzeros (obj coefs + constraint coefs): 75019; reported optimal value: Infeasible. BGINDY is a large problem that was originally an integer program of unknown origin.  Infeasibility is original.</description>
		<originalFileName>bgindy.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>bgindy.osil</osFileName>
	</instance>
	<instance>
		<name>BGPRTR</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University. Contributor:  Linus Schrage, University of Chicago and LINDO Systems Inc. </source>
		<description>objectives: 1 (minimization); constraints: 20; variables: 34; nonzeros (obj coefs + constraint coefs): 90; reported optimal value: Infeasible. BGPRTR is a small model for a multiproduct, multiperiod production scheduling model.  One right hand side has been altered to make it infeasible.</description>
		<originalFileName>bgprtr.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>bgprtr.osil</osFileName>
	</instance>
	<instance>
		<name>BOX1</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University. Contributor: Zhengping You, Carleton University.</source>
		<description>objectives: 1 (minimization); constraints: 231; variables: 261; nonzeros (obj coefs + constraint coefs): 912; reported optimal value: Infeasible. This medium size problem is derived from research on using the infeasibility version of viability analysis [Chinneck 1992] to analyze petri net models.  It is quite volatile, showing IISs of widely differing size depending on the algorithm applied. </description>
		<originalFileName>box1.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>box1.osil</osFileName>
	</instance>
	<instance>
		<name>CERIA3D</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University.  Contributor:  Ed Klotz, CPLEX Optimization Inc.</source>
		<description>objectives: 1 (minimization); constraints: 3576; variables: 824; nonzeros (obj coefs + constraint coefs): 17604; reported optimal value: Infeasible. This is a large problem which has some peculiarities.  There are no column bounds, and it is highly degenerate. </description>
		<originalFileName>ceria3d.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>ceria3d.osil</osFileName>
	</instance>
	<instance>
		<name>CHEMCOM</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University. Contributor:  Tom Baker, Chesapeake Decision Sciences.</source>
		<description>objectives: 1 (minimization); constraints: 288; variables: 720; nonzeros (obj coefs + constraint coefs): 2190; reported optimal value: Infeasible. This is a medium size problem derived from a petrochemical plant model.  Doctored to generate infeasibility due to inability to meet volume or quality restrictions.  It is a highly volatile problem, yielding IISs of varying sizes when different IIS isolation algorithms are applied. See Chinneck [1993] for further discussion. </description>
		<originalFileName>chemcom.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>chemcom.osil</osFileName>
	</instance>
	<instance>
		<name>CPLEX1</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University. Contributor:  Ed Klotz, CPLEX Optimization Inc.</source>
		<description>objectives: 1 (minimization); constraints: 3005; variables: 3221; nonzeros (obj coefs + constraint coefs): 10664; reported optimal value: Infeasible. CPLEX1 is referred to as CPLEX problem in Chinneck [1993], and is remarkably non-volatile, showing a single small IIS regardless of the IIS algorithm applied. </description>
		<originalFileName>cplex1.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>cplex1.osil</osFileName>
	</instance>
	<instance>
		<name>CPLEX2</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University.  Contributor:  Ed Klotz, CPLEX Optimization Inc.</source>
		<description>objectives: 1 (minimization); constraints: 224; variables: 221; nonzeros (obj coefs + constraint coefs): 1059; reported optimal value: Infeasible. CPLEX2 is an almost-feasible problem.</description>
		<originalFileName>cplex2.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>cplex2.osil</osFileName>
	</instance>
	<instance>
		<name>EX72A</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University. Contributor: Zhengping You, Carleton University.</source>
		<description>objectives: 1 (minimization); constraints: 197; variables: 215; nonzeros (obj coefs + constraint coefs): 682; reported optimal value: Infeasible. This medium size problem is derived from research on using the infeasibility version of viability analysis [Chinneck 1992] to analyze petri net models.  It is quite volatile, showing IISs of widely differing size depending on the algorithm applied. </description>
		<originalFileName>ex72a.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>ex72a.osil</osFileName>
	</instance>
	<instance>
		<name>EX73A</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University. Contributor: Zhengping You, Carleton University.</source>
		<description>objectives: 1 (minimization); constraints: 193; variables: 211; nonzeros (obj coefs + constraint coefs): 668; reported optimal value: Infeasible. This medium size problem is derived from research on using the infeasibility version of viability analysis [Chinneck 1992] to analyze petri net models.  It is quite volatile, showing IISs of widely differing size depending on the algorithm applied. </description>
		<originalFileName>ex73a.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>ex73a.osil</osFileName>
	</instance>
	<instance>
		<name>FOREST6</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University. Contributor:  H.J.  Greenberg, University of Colorado at Denver. </source>
		<description>objectives: 1 (minimization); constraints: 66; variables: 95; nonzeros (obj coefs + constraint coefs): 270; reported optimal value: Infeasible. This is a very small problem derived from a network-based forestry model.  The IIS in FOREST6 includes most of the rows.</description>
		<originalFileName>forest6.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>forest6.osil</osFileName>
	</instance>
	<instance>
		<name>GALENET</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University. Contributor:  H.J.  Greenberg, University of Colorado at Denver.</source>
		<description>objectives: 1 (minimization); constraints:8; variables: 8; nonzeros (obj coefs + constraint coefs): 16; reported optimal value: Infeasible. This is a a very small network problem. </description>
		<originalFileName>galenet.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>galenet.osil</osFileName>
	</instance>
	<instance>
		<name>GOSH</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University.  Contributor:  Roger Main, BP Oil.</source>
		<description>objectives: 1 (minimization); constraints: 3792; variables: 10733; nonzeros (obj coefs + constraint coefs): 97257; reported optimal value: Infeasible. This is a very large model. It arose from British Petroleum operations models. </description>
		<originalFileName>gosh.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>gosh.osil</osFileName>
	</instance>
	<instance>
		<name>GRAN</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University.  Contributor:  Roger Main, BP Oil.</source>
		<description>objectives: 1 (minimization); constraints: 2568; variables: 2520; nonzeros (obj coefs + constraint coefs): 20151; reported optimal value: Infeasible. This is a large model. It arose from British Petroleum operations models. </description>
		<originalFileName>gran.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>gran.osil</osFileName>
	</instance>
	<instance>
		<name>GREENBEA_INFEASIBLE</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University. Contributor:  Robert Fourer, Northwestern University.</source>
		<description>objectives: 1 (minimization); constraints: 2393; variables: 5405; nonzeros (obj coefs + constraint coefs): 36288; reported optimal value: Infeasible. This large problem is the original version of the NETLIB GREENBEA problem.  The feasible NETLIB version was created by Bob Fourer by repairing the version given here.  The GREENBEA problem is network based and originates in the petrochemical industry. This problem has 111 N-type rows in the MPS file. In converting the problem, Kipp Martin used a parser that treats the first N-type row ("B...FR..") as the objective function and the rest 110 N-type row as free constraint and didn't not include them in the OSiL file.The parser also generates a dense objective coefficient section; thus the nonzero count (36288) contains all the zero value objective coefficients. In the original MPS file, there are 2504 constraints (with the 110 N-type constraint rows). The original MPS file also contains 35159 nonzeros. </description>
		<originalFileName>greenbea_infeasible.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>greenbea_infeasible.osil</osFileName>
	</instance>
	<instance>
		<name>ITEST2</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University. Contributors:  J.W.  Chinneck and E.W.  Dravnieks, Carleton University.</source>
		<description>objectives: 1 (minimization); constraints: 9; variables: 4; nonzeros (obj coefs + constraint coefs): 17; reported optimal value: Infeasible. This is a very small problem having numerous clustered IISs. It matches problem 2 in Chinneck and Dravnieks [1991].</description>
		<originalFileName>itest2.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>itest2.osil</osFileName>
	</instance>
	<instance>
		<name>ITEST6</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University. Contributors:  J.W.  Chinneck and E.W.  Dravnieks, Carleton University.</source>
		<description>objectives: 1 (minimization); constraints: 11; variables: 8; nonzeros (obj coefs + constraint coefs): 23; reported optimal value: Infeasible. This is a very small problem having numerous clustered IISs. It matches problem 1 in Chinneck and Dravnieks [1991]. </description>
		<originalFileName>itest6.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>itest6.osil</osFileName>
	</instance>
	<instance>
		<name>KLEIN1</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University. Contributor:  Ed Klotz, CPLEX Optimization Inc.</source>
		<description>objectives: 1 (minimization); constraints: 54; variables: 54; nonzeros (obj coefs + constraint coefs): 696; reported optimal value: Infeasible. This problem is related with KLEIN2 and KLEIN3. </description>
		<originalFileName>klein1.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>klein1.osil</osFileName>
	</instance>
	<instance>
		<name>KLEIN2</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University. Contributor:  Ed Klotz, CPLEX Optimization Inc.</source>
		<description>objectives: 1 (minimization); constraints: 477; variables: 54; nonzeros (obj coefs + constraint coefs): 4585; reported optimal value: Infeasible. This problem is related with KLEIN1 and KLEIN3. </description>
		<originalFileName>klein2.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>klein2.osil</osFileName>
	</instance>
	<instance>
		<name>KLEIN3</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University. Contributor:  Ed Klotz, CPLEX Optimization Inc.</source>
		<description>objectives: 1 (minimization); constraints: 994; variables: 88; nonzeros (obj coefs + constraint coefs): 12107; reported optimal value: Infeasible. This problem is related with KLEIN1 and KLEIN2. </description>
		<originalFileName>klein3.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>klein3.osil</osFileName>
	</instance>
	<instance>
		<name>MONDOU2</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University. Contributor:  J.-F.  Mondou, Hydro-Quebec.</source>
		<description>objectives: 1 (minimization); constraints: 312; variables: 604; nonzeros (obj coefs + constraint coefs): 1623; reported optimal value: Infeasible. This is a medium size problem generated as a subproblem to a larger facility sizing algorithm used by Hydro-Quebec.  The diagnosis of the infeasibility in the subproblem is useful to the larger algorithm.</description>
		<originalFileName>mondou2.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>mondou2.osil</osFileName>
	</instance>
	<instance>
		<name>PANG</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University.  Contributor:  Roger Main, BP Oil.</source>
		<description>objectives: 1 (minimization); constraints: 361; variables: 460; nonzeros (obj coefs + constraint coefs): 2666; reported optimal value: Infeasible. This is a medium size model. It arose from British Petroleum operations models. </description>
		<originalFileName>pang.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>pang.osil</osFileName>
	</instance>
	<instance>
		<name>PILOT4I</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University. Contributor:  John Stone, Ketron Management Science.</source>
		<description>objectives: 1 (minimization); constraints: 410; variables: 1000; nonzeros (obj coefs + constraint coefs): 5145; reported optimal value: Infeasible. This is a medium size problem generated by doctoring the original NETLIB PILOT4 model.  </description>
		<originalFileName>pilot4i.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>pilot4i.osil</osFileName>
	</instance>
	<instance>
		<name>QUAL</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University. Contributor:  Tom Baker, Chesapeake Decision Sciences.</source>
		<description>objectives: 1 (minimization); constraints: 323; variables: 464; nonzeros (obj coefs + constraint coefs): 1714; reported optimal value: Infeasible. This is a medium size problem derived from a petrochemical plant model.  Doctored to generate infeasibility due to inability to meet volume or quality restrictions.  It is a highly volatile problem, yielding IISs of varying sizes when different IIS isolation algorithms are applied. See Chinneck [1993] for further discussion. </description>
		<originalFileName>qual.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>qual.osil</osFileName>
	</instance>
	<instance>
		<name>REACTOR</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University. Contributor:  Tom Baker, Chesapeake Decision Sciences.</source>
		<description>objectives: 1 (minimization); constraints: 318; variables: 637; nonzeros (obj coefs + constraint coefs): 2995; reported optimal value: Infeasible. This is a medium size problem derived from a petrochemical plant model.  Doctored to generate infeasibility due to inability to meet volume or quality restrictions. See Chinneck [1993] for further discussion. </description>
		<originalFileName>reactor.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>reactor.osil</osFileName>
	</instance>
	<instance>
		<name>REFINERY</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University. Contributor:  Tom Baker, Chesapeake Decision Sciences.</source>
		<description>objectives: 1 (minimization); constraints: 323; variables: 464; nonzeros (obj coefs + constraint coefs): 1694; reported optimal value: Infeasible. This is a medium size problem derived from a petrochemical plant model.  Doctored to generate infeasibility due to inability to meet volume or quality restrictions.  It is a highly volatile problem, yielding IISs of varying sizes when different IIS isolation algorithms are applied. See Chinneck [1993] for further discussion. </description>
		<originalFileName>refinery.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>refinery.osil</osFileName>
	</instance>
	<instance>
		<name>VOL1</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University. Contributor:  Tom Baker, Chesapeake Decision Sciences.</source>
		<description>objectives: 1 (minimization); constraints: 323; variables: 464; nonzeros (obj coefs + constraint coefs): 1714; reported optimal value: Infeasible. This is a medium size problem derived from a petrochemical plant model.  Doctored to generate infeasibility due to inability to meet volume or quality restrictions.  It is a highly volatile problem, yielding IISs of varying sizes when different IIS isolation algorithms are applied. See Chinneck [1993] for further discussion. </description>
		<originalFileName>vol1.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>vol1.osil</osFileName>
	</instance>
	<instance>
		<name>WOODINFE</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the infeasible problems in the Netlib Repository. Originally collected by John W. Chinneck from Carleton University. Contributor:  H.J.  Greenberg, University of Colorado at Denver.</source>
		<description>objectives: 1 (minimization); constraints: 35; variables: 89; nonzeros (obj coefs + constraint coefs): 209; reported optimal value: Infeasible. This is a very small problem derived from a network-based forestry models. It is the example problem discussed in detail in Greenberg [1993], and has a very small IIS.</description>
		<originalFileName>woodinfe.mps</originalFileName>
		<osDirectoty>linear/continuous/infeasible/</osDirectoty>
		<osFileName>woodinfe.osil</osFileName>
	</instance>
</osRepository>
<!-- sample
	<instance>
		<name>XXXX</name>
		<source>Converted by Jun Ma, Kipp Martin, Huanyuan Sheng from the Netlib Repository. Originally supplied by </source>
		<description>objectives: 1 (minimization); constraints: ; variables:; nonzeros (obj coefs + constraint coefs):; reported optimal value:</description>
		<originalFileName>xxxx.mps</originalFileName>
		<osDirectoty>linear/continuous/</osDirectoty>
		<osFileName>xxxx.osil</osFileName>
	</instance>
	-->
