US2006197769A1PendingUtilityA1
Method and apparatus for generating profile of solutions trading off number of activities utilized and objective value for bilinear integer optimization models
Est. expiryMar 2, 2025(expired)· nominal 20-yr term from priority
Inventors:Jonathan Lee
G06Q 10/04
55
PatentIndex Score
0
Cited by
0
References
0
Claims
Abstract
A method (and system) of generating at least one of a solution and a profile of solutions for a problem, includes trading off a reduction of an objective of the problem against a number of activities utilized in a solution.
Claims
exact text as granted — not AI-modified1 . A method of generating at least one of a solution and a profile of solutions for a problem, comprising:
trading off a reduction of an objective of the problem against a number of distinct activities utilized in a solution.
2 . The method according to claim 1 , further comprising:
generating a model including at least a first set of variables and data and a second set of variables and data.
3 . The method according to claim 2 , wherein said first set of variables and data comprises known activities and said second set of variables and data comprises potential new activities.
4 . The method according to claim 2 , further comprising:
setting an initial size of said first set of variables and data and an initial size of said second set of variables and data.
5 . The method according to claim 2 , further comprising:
partially linearizing said model to remove instances of bilinear terms involving said second set of variables and data.
6 . The method according to claim 2 , further comprising:
solving said model using a computational algorithm.
7 . The method according to claim 2 , further comprising:
transferring activities in said second set of variables and data that provide an optimal solution from said second set of variables and data to said first set of variables and data.
8 . The method according to claim 1 , further comprising:
generating new activities during development of said model.
9 . The method according to claim 1 , wherein said profile of solutions comprises a plurality of possible solutions.
10 . The method according to claim 1 , further comprising:
dynamically limiting a number of times each of said number of activities is used.
11 . The method according to claim 3 , further comprising:
determining whether moving at least one of said potential new activities from said second set of variables and data to said first set of variables and data would provide an improvement to said solution.
12 . A method of generating at least one of a solution and a profile of solutions for a cutting stock problem, comprising:
trading off a reduction of an amount of wasted stock material against a number of distinct patterns utilized to satisfy demands.
13 . A computer system for generating at least one of a solution and a profile of solutions for a problem, comprising:
means for generating a model having a first set of variables and data and a second set of variables and data; and means for repeatedly solving the model to generate a profile of solutions.
14 . A computer system for generating at least one of a solution and a profile of solutions for a problem, comprising:
an augmenting unit that repeatedly solves a model to generate a profile of solutions, wherein said profile trades off a reduction of an objective of the problem against a number of distinct activities utilized in a solution.
15 . The computer system according to claim 14 , further comprising:
a partitioning unit that generates said model, said model comprising a first set of data and variables and a second set of data and variables.
16 . The computer system according to claim 15 , further comprising:
an initializing unit that sets an initial size of said first set of data and variables and an initial size of said second set of data and variables.
17 . The computer system according to claim 15 , further comprising:
a testing unit that determines whether moving a point from said second set of data and variables to said first set of data and variables would improve the solution.
18 . A signal-bearing medium tangibly embodying a program of machine readable instructions executable by a digital processing apparatus to perform a of generating at least one of a solution and a profile of solutions for a problem, according to claim 1 .
19 . A method of deploying computing infrastructure, comprising integrating computer-readable code into a computing system, wherein the computer readable code in combination with the computing system is capable of performing a method of generating at least one of a solution and a profile of solutions for a problem, according to claim 1 .
20 . The signal-bearing medium according to claim 18 , further comprising:
generating a model including at least a first set of variables and data and a second set of variables and data.
21 . The method according to claim 1 , wherein said reduction comprises a minimization.Join the waitlist — get patent alerts
Track US2006197769A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.