Abstract: A computer implemented method for assigning values to objects includes receiving a plurality of values for each of a plurality of base objects including a first and second base object; receiving a plurality of values for a first composite object associated with the first and second base objects; generating and storing in the memory a solution set including combinations of values of the first and second base objects; for each combination in the solution set, generating first transaction results by computing transactions between the values of the first and second base objects; comparing each of the first transaction results to a first range of values including the values of the first composite object; and removing, from the solution set and from the memory, the combinations of the values of the first and second base objects corresponding to the first transaction results that are outside of the first range of values.

Abstract: A computer implemented method for assigning values to objects includes receiving a plurality of values for each of a plurality of base objects including a first and second base object; receiving a plurality of values for a first composite object associated with the first and second base objects; generating and storing in the memory a solution set including combinations of values of the first and second base objects; for each combination in the solution set, generating first transaction results by computing transactions between the values of the first and second base objects; comparing each of the first transaction results to a first range of values including the values of the first composite object; and removing, from the solution set and from the memory, the combinations of the values of the first and second base objects corresponding to the first transaction results that are outside of the first range of values.

Abstract: A computer implemented method for assigning values to objects includes receiving a plurality of values for each of a plurality of base objects including a first and second base object; receiving a plurality of values for a first composite object associated with the first and second base objects; generating and storing in the memory a solution set including combinations of values of the first and second base objects; for each combination in the solution set, generating first transaction results by computing transactions between the values of the first and second base objects; comparing each of the first transaction results to a first range of values including the values of the first composite object; and removing, from the solution set and from the memory, the combinations of the values of the first and second base objects corresponding to the first transaction results that are outside of the first range of values.

Abstract: A computer implemented method for assigning values to objects includes receiving a plurality of values for each of a plurality of base objects including a first and second base object; receiving a plurality of values for a first composite object associated with the first and second base objects; generating and storing in the memory a solution set including combinations of values of the first and second base objects; for each combination in the solution set, generating first transaction results by computing transactions between the values of the first and second base objects; comparing each of the first transaction results to a first range of values including the values of the first composite object; and removing, from the solution set and from the memory, the combinations of the values of the first and second base objects corresponding to the first transaction results that are outside of the first range of values.

Abstract: The disclosed embodiments relate to an exchange computing system which selectively prematurely expires financial instruments in order to finally settle them and remove them from the computing system. In particular, the disclosed embodiments recognize that during the pendency of a futures contract between first available trade date and the expiration, the exchange computing system must facilitate trading thereof by tracking traders positions, providing regular pricing data as well as transacting trades therefore. This consumes exchange resource especially given the number of products offered and the extended length of term for some. Accordingly where contracts can be settled early and thereby removed from being transacted, exchange resources may be conserved.

Abstract: The disclosed embodiments relate to an exchange computing system which selectively prematurely expires financial instruments in order to finally settle them and remove them from the computing system. In particular, the disclosed embodiments recognize that during the pendency of a futures contract between first available trade date and the expiration, the exchange computing system must facilitate trading thereof by tracking traders positions, providing regular pricing data as well as transacting trades therefore. This consumes exchange resource especially given the number of products offered and the extended length of term for some. Accordingly where contracts can be settled early and thereby removed from being transacted, exchange resources may be conserved.

Abstract: A computer implemented method for assigning values to objects includes receiving a plurality of values for each of a plurality of base objects including a first and second base object; receiving a plurality of values for a first composite object associated with the first and second base objects; generating and storing in the memory a solution set including combinations of values of the first and second base objects; for each combination in the solution set, generating first transaction results by computing transactions between the values of the first and second base objects; comparing each of the first transaction results to a first range of values including the values of the first composite object; and removing, from the solution set and from the memory, the combinations of the values of the first and second base objects corresponding to the first transaction results that are outside of the first range of values.

Abstract: A computer implemented method for assigning values to objects includes receiving a plurality of values for each of a plurality of base objects including a first and second base object; receiving a plurality of values for a first composite object associated with the first and second base objects; generating and storing in the memory a solution set including combinations of values of the first and second base objects; for each combination in the solution set, generating first transaction results by computing transactions between the values of the first and second base objects; comparing each of the first transaction results to a first range of values including the values of the first composite object; and removing, from the solution set and from the memory, the combinations of the values of the first and second base objects corresponding to the first transaction results that are outside of the first range of values.

Abstract: The disclosed embodiments relate to an exchange computing system which selectively prematurely expires financial instruments in order to finally settle them and remove them from the computing system. In particular, the disclosed embodiments recognize that during the pendency of a futures contract between first available trade date and the expiration, the exchange computing system must facilitate trading thereof by tracking traders positions, providing regular pricing data as well as transacting trades therefore. This consumes exchange resource especially given the number of products offered and the extended length of term for some. Accordingly where contracts can be settled early and thereby removed from being transacted, exchange resources may be conserved.

Abstract: A computer implemented method for assigning values to objects includes receiving a plurality of values for each of a plurality of base objects including a first and second base object; receiving a plurality of values for a first composite object associated with the first and second base objects; generating and storing in the memory a solution set including combinations of values of the first and second base objects; for each combination in the solution set, generating first transaction results by computing transactions between the values of the first and second base objects; comparing each of the first transaction results to a first range of values including the values of the first composite object; and removing, from the solution set and from the memory, the combinations of the values of the first and second base objects corresponding to the first transaction results that are outside of the first range of values.