ponderthis0517-inf

infeasible binary feasibility benchmark_suitable set_partitioning set_packing

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Rob Pratt	975	78	3.84615e-02	easy	–	Infeasible	ponderthis0517-inf.mps.gz

Infeasible version of IBM Ponder This problem (with 52 characters and no spaces) from May 2017: https://www.research.ibm.com/haifa/ponderthis/challenges/May2017.html

Location of instance in collection

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
	Original	Presolved
Variables	975	975
Constraints	78	78
Binaries	975	975
Integers	0	0
Continuous	0	0
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	0.0384615	0.0384615
Nonzeroes	2925	2925

Constraint Classification Properties
	Original	Presolved
Total	78	78
Empty	0	0
Free	0	0
Singleton	0	0
Aggregations	0	0
Precedence	0	0
Variable Bound	0	0
Set Partitioning	26	26
Set Packing	52	52
Set Covering	0	0
Cardinality	0	0
Invariant Knapsack	0	0
Equation Knapsack	0	0
Bin Packing	0	0
Knapsack	0	0
Integer Knapsack	0	0
Mixed Binary	0	0
General Linear	0	0
Indicator	0	0

Structure

Available nonzero structure and decomposition information. Further information can be found here.

Nonzero entries of original problem

Nonzero entries after trivial presolving

Decomposed structure of original problem (dec-file)

Decomposed structure after trivial presolving (dec-file)

	value	min	median	mean	max
Components	1.431364
Constraint %		1.28205	1.28205	1.28205	1.28205
Variable %		2.56410	3.84615	3.84615	5.12821
Score	0.320513

Best Known Solution(s)

No solution available for ponderthis0517-inf .

Similar instances in collection

The following instances are most similar to ponderthis0517-inf in the collection. This similarity analysis is based on 100 scaled instance features describing properties of the variables, objective function, bounds, constraints, and right hand sides.

Instance	Status	Variables	Binaries	Continuous	Constraints	Nonz.	Submitter	Group	Objective	Tags
neos-3226448-wkra	easy	10012	10012	0	2208	40048	Jeff Linderoth	neos-pseudoapplication-103	0	binary feasibility benchmark_suitable set_partitioning
neos-4382714-ruvuma	easy	6562	6561	1	3645	32805	Hans Mittelmann	neos-pseudoapplication-103	Infeasible	infeasible binary feasibility benchmark_suitable set_partitioning
10teams	easy	2025	1800	225	230	12150	MIPLIB submission pool	–	923.9999999999997	binary set_partitioning set_packing invariant_knapsack
neos-1516309	easy	4500	4500	0	489	30400	NEOS Server Submission	neos-pseudoapplication-26	35954	binary decomposition set_packing set_covering knapsack
neos-1599274	easy	4500	4500	0	1237	46800	NEOS Server Submission	neos-pseudoapplication-26	32075.6	binary decomposition set_packing set_covering knapsack

Reference

No bibliographic information available