Abstract: An Optimization Server reduces M×N iteration space using various techniques to enhance computer performance by improving computer runtime and memory usage. The Optimization Server determines an aggregate combination of bids that results in high proceeds on individual assets of a portfolio subject to minimum and maximum constraints imposed by a bidder across a plurality of individual asset bids. The Optimization Server stores in a memory a portfolio array including M number of elements. Each portfolio array element corresponds to a bid array of bids on the plurality of individual assets of the portfolio. Each bid array includes N number of elements and each bid array element corresponds to a bid amount on one of the plurality of individual assets in the portfolio. The bid array also includes a corresponding minimum constraint and a corresponding maximum constraint across all of the individual asset-level bids placed on the portfolio.

Abstract: An Optimization Server reduces M×N iteration space using various techniques to enhance computer performance by improving computer runtime and memory usage. The Optimization Server determines an aggregate combination of bids that results in high proceeds on individual assets of a portfolio subject to minimum and maximum constraints imposed by a bidder across a plurality of individual asset bids. The Optimization Server stores in a memory a portfolio array including M number of elements. Each portfolio array element corresponds to a bid array of bids on the plurality of individual assets of the portfolio. Each bid array includes N number of elements and each bid array element corresponds to a bid amount on one of the plurality of individual assets in the portfolio. The bid array also includes a corresponding minimum constraint and a corresponding maximum constraint across all of the individual as set-level bids placed on the portfolio.