# Mixed Integer Linear Programming (MILP) Optimization Mixed Integer Linear Programming (MILP) allows for the searching of clearing prices and associated sets of consistent orders that maximize executed volume and satisfy best execution requirements. The optimization incorporates conditional orders and automatic replication. MILP utilizes advanced heuristics to perform an efficient search of the solution space using the branch-and-bound algorithm for binary integer constraints. --- # Agent Instructions: Querying This Documentation If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question. Perform an HTTP GET request on the current page URL with the `ask` query parameter: ``` GET https://docs.ithacaprotocol.io/docs/architecture/pre-match-processing/mixed-integer-linear-programming-milp-optimization.md?ask= ``` The question should be specific, self-contained, and written in natural language. The response will contain a direct answer to the question and relevant excerpts and sources from the documentation. Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.