# Geometric Presolver example

### From Wikimization

Assume that the following problem is massive:

The problem is presumed solvable but not computable by any contemporary means. The most logical strategy is to make the problem smaller.

This file contains a real E matrix having dimension and compatible vector. There exists a cardinality binary solution . Before attempting to find it, we presume to have no choice but to reduce dimension of the matrix prior to computing a solution.

A lower bound on the number of rows of retained is .

A lower bound on the number of columns retained is .

The present exercise is to determine those rows and columns using any contemporary presolver.