Method and system for scheduling using a facet ascending algorithm or a reduced complexity bundle method for solving an integer programming problem
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Feb 3, 1998
Grant Date -
N/A
app pub date -
Dec 23, 1994
filing date -
Dec 23, 1994
priority date (Note) -
Expired
status (Latency Note)
A preliminary load of PAIR data current through [] has been loaded. Any more recent PAIR data will be loaded within twenty-four hours. |
PAIR data current through []
A preliminary load of cached data will be loaded soon.
Any more recent PAIR data will be loaded within twenty-four hours.
Next PAIR Update Scheduled on [ ] |
Importance
US Family Size
|
Non-US Coverage
|
Patent Longevity
|
Forward Citations
|
Abstract
A method and system for scheduling using a facet ascending algorithm or a reduced complexity bundle method for solving an integer programming problem is presented. A Lagrangian dual function of an integer scheduling problem is maximized (for a primal minimization problem) to obtain a good near-feasible solution, and to provide a lower bound to the optimal value of the original problem. The dual function is a polyhedral concave function made up of many facets. The facet ascending algorithm of the present invention exploits the polyhedral concave nature of the dual function by ascending facets along intersections of facets. At each iteration, the algorithm finds the facets that intersect at the current dual point, calculates a direction of ascent along these facets, and then performs a specialized line search which optimizes a scaler polyhedral concave function in a finite number of steps. An improved version of the facet ascending algorithm, the reduced complexity bundle method, maximizes a nonsmooth concave function of variables. This is accomplished by finding a hyperplane separating the origin and the affine manifold of a polyhedron. The hyperplane also separates the origin and the polyhedron since the polyhedron is a subset of its affine manifold. Then an element of the bundle is projected onto the subspace normal to the affine manifold to produce a trial direction normal. If the projection is zero (i.e., indicating the affine manifold contains the origin), a re-projection onto the subspace normal to the affine manifold of an appropriate face of the polyhedron gives a trial direction. This reduced complexity bundle method always finds an .epsilon.-ascent trial direction or detects an .epsilon.-optimal point, thus maintaining global convergence. The method can be used to maximize the dual function of a mixed-integer scheduling problem.
First Claim
Family
- 15 United States
- 10 France
- 8 Japan
- 7 China
- 5 Korea
- 2 Other
Patent Owner(s)
- THE UNIVERSITY OF CONNECTICUT
International Classification(s)
Inventor(s)
Inventor Name | Address | # of filed Patents | Total Citations |
---|---|---|---|
Luh, Peter B | Storrs, CT | 6 | 131 |
Tomastik, Robert N | Manchester, CT | 6 | 154 |
Cited Art Landscape
- No Cited Art to Display
Patent Citation Ranking
Forward Cite Landscape
- No Forward Cites to Display
Maintenance Fees
Fee | Large entity fee | small entity fee | micro entity fee | due date |
---|
Fee | Large entity fee | small entity fee | micro entity fee |
---|---|---|---|
Surcharge after expiration - Late payment is unavoidable | $700.00 | $350.00 | $175.00 |
Surcharge after expiration - Late payment is unintentional | $1,640.00 | $820.00 | $410.00 |
Full Text
Legal Events
Matter Detail
Update Public Data Dismiss Edit SaveRenewals Detail
Edit SaveNote
The template below is formatted to ensure compatibility with our system.
Provide tags with | separated like (tags1|tags2).
Maximum length is 128 characters for Customer Application No
Mandatory Fields * - 'MatterType','AppType','Country','Title','SerialNo'.
Acceptable Date Format - 'MM/DD/YYYY'.
Acceptable Filing/App Types -
- Continuation/Divisional
- Original
- Paris Convention
- PCT National
- With Priority
- EP Validation
- Provisional Conversion
- Reissue
- Provisional
- Foreign Extension
Acceptable Status -
- Pending
- Abandoned
- Unfiled
- Expired
- Granted
Acceptable Matter Types -
- Patent
- Utility Model
- Supplemental Protection Certificate
- Design
- Inventor Certificate
- Plant
- Statutory Invention Reg
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Success
E-mail has been sent successfully.
Failure
Some error occured while sending email. Please check e-mail and try again!
PAIR load has been initiated
A preliminary load of cached data will be loaded soon. Current PAIR data will be loaded within twenty four hours.
File History PDF
Thank you for your purchase! The File Wrapper for Patent Number 5715165 will be available within the next 24 hours.
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully
Important Notes on Latency of Status data
Please note there is up to 60 days of latency in this Status indicator for certain status conditions. You can obtain up-to-date Status indicator readings by ordering PAIR for the file.
An application with the status "Published" (which means it is pending) may be recently abandoned, but not yet updated to reflect its abandoned status. However, an application filed less than one year ago is unlikely to be abandoned.
A patent with the status "Granted" may be recently expired, but not yet updated to reflect its expired status. However, it is highly unlikely a patent less than 3.5 years old would be expired.
An application with the status "Abandoned" is almost always current, but there is a small chance it was recently revived and the status not yet updated.
Important Note on Priority Date data
This priority date is an estimated earliest priority date and is purely an estimation. This date should not be taken as legal conclusion. No representations are made as to the accuracy of the date listed. Please consult a legal professional before relying on this date.
We are sorry but your current selection exceeds the maximum number of portfolios (0) for this membership level. Upgrade to our Level for up to -1 portfolios!.