Abstract: According to one embodiment, a computer-implemented method for multi-party constrained optimization is provided. The method includes accessing a first optimization problem corresponding to a first party to a negotiation, the first optimization problem including at least one first objective and one or more first constraints to which the first objective relates, and accessing a second optimization problem corresponding to a second party to the negotiation, the second optimization problem including at least one second objective and one or more second constraints to which the second objective relates. A first optimal value is determined for the at least one first objective considering the one or more first constraints for the first optimization problem, and a second optimal value is determined for the at least one second objective considering the one or more second constraints for the second optimization problem.

Abstract: Ordering items often involves first searching a catalogue or the like for the proper item. If not done accurately, or if not done in a time efficient manner, unacceptable loss can occur because the wrong item is ordered or all orders cannot be placed when needed. A parametric searching tool represented in various embodiments makes searching very effective. Searching is based upon user selection of specific attributes for attribute characteristics available for the user to view for determining search parameters. By being able to utilize parameters, which are already available in a database, the user does not require significant training to know how to construct a search nor particular knowledge of the attribute characteristics or specific attributes of all the various suppliers from which orders can be made.

Abstract: In one aspect, a computer-implemented method is provided for aggregating and scheduling product batches in a manufacturing environment. Using a batch aggregation engine implementing a mathematical programming strategy, one or more product demands are allocated to one or more product batches having suggested sizes and suggested starting times. The mathematical programming strategy includes evaluating a number of time-based penalties relative to one another in allocating the demands to the batches, the time-based penalties being based on relationships between suggested starting times for batches and times of demands being considered for allocation to batches. The suggested sizes, the suggested starting times, and feedback relating to the suggested sizes and suggested starting times are communicated from the batch aggregation engine to a scheduling engine to assist the scheduling engine in scheduling starting times for the batches.

Abstract: In one embodiment, a method is provided for collaboratively solving an optimization problem using at least first optimization software and second optimization software each having at least partial information concerning the optimization problem.