Patent EP0514101A2 successfully refreshed from Google Patents.
← Back to Patent Explorer
EP0514101A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

Method for operating a computer system to resolve numerical planning problems

Assignee: International Business Machines Corp
•
Filing: 1992-05-11
•
Granted: —
•
Expires: 2012-05-11
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Variables of a numerical planning problem are displayed as graphical objects on a display unit 10, guidance constraints are added to corresponding variables by manipulating graphics objects through a mouse 11, and corresponding variable values are modified through manipulation to the graphics objects. The planner can confirm guidance constraints set to the graphics objects by color display. A new solution is obtained under constraints oriented to the problem and guidance constraints by the operations research procedure 6 using the distance from a preceding solution as an objective function. <IMAGE>

Inventors

  • 👤 Hiroaki Etoh
  • 👤 Keiichi Maruyama

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-10-31 16:47
CPC Classifications
G; G06; G06Q; G06Q10/00; G06Q10/06; G06F; G06F40/00; G06F40/10; G06F40/166; G06F40/177; G06F40/18; Y; Y10; Y10S; Y10S715/00; Y10S715/961; Y10S715/965; Y10S715/966; Y10S715/967

Claims Analysis

Total Claims: 12
Claim 1
Independent Claim 185 words
A computer system adapted to resolve numerical planning problems wherein variable values which satisfy planning problem oriented constraint expressions are displayed as graphics objects on a graphical display unit, and said variable values are iteratively modified according to guidance inputted by manipulation of a planner to said graphics objects through said graphical display unit, whereby said variable values are obtained which satisfy the intention of said planner, the computer system comprising: means for inputting said planning problem oriented constraint expressions; means for displaying said variable values which satisfy said expressions as graphics objects on said graphical display unit; means for inputting one or more guidance constraints to one or more of said variable values through manipulation of said planner to corresponding one or more of said graphics objects; means for executing modification of one or more of said variable values through manipulation of said planner to corresponding one or more of said graphics objects; and means for calculating new variable values responsive to said modification and based on said planning problem oriented constraint expressions, said guidance constraints, and a current set of said variable values.
Claim 2
Dependent Claim 25 words
A system as claimed in claim 1 further comprising means for giving display attributes corresponding to types of said guidance constraints to said graphics objects.
Claim 3
Dependent Claim 38 words
A system as claimed in claim 1 or 2 wherein said guidance constraints include constraints accepting modification to larger values than current ones, constraints accepting modification to smaller values than current ones, and constraints fixing to current values.
Claim 4
Independent Claim 123 words
A method of operating a computer system to resolve numerical planning problems wherein variable values which satisfy planning problem oriented constraint expressions are iteratively modified according to guidance of a planner, whereby said variable values are obtained which satisfy the intention of said planner, the method comprising the steps of: receiving input of said planning problem oriented constraint expressions; receiving input of initial variable values which satisfy said planning problem oriented constraint expressions; receiving input of one or more constraint expressions other than said planning problem oriented constraint expressions; and selecting as new variable values those which satisfy said planning problem oriented constraint expressions and said other constraint expressions, and also optimize predetermined criteria in terms of a current set of variable values.
Claim 5
Dependent Claim 20 words
A method as claimed in claim 4 wherein types of said planning problem oriented constraint expressions are equalities and inequalities.
Claim 6
Dependent Claim 26 words
A method as claimed in claim 4 or 5 wherein types of said planning problem oriented constraint expressions are one or both of equalities and inequalities.
Claim 7
Dependent Claim 25 words
A method as claimed in claim 4, 5 or 6 wherein said initial variable values are solutions obtained when said inequalities are regarded as equalities.
Claim 8
Independent Claim 35 words
A method as claimed in any of claims 4 to 7 wherein said predetermined criteria is the distance between said current set of variable values and a set of variable values to be newly obtained.
Claim 9
Independent Claim 163 words
A method for operating a computer system to resolve numerical planning problems wherein variable values which satisfy planning problem oriented constraint expressions are displayed as graphics objects on a graphical display unit, and said variable values are iteratively modified according to guidance inputted by manipulation of a planner to said graphics objects through said graphical display system, whereby said variable values are obtained which satisfy the intention of said planner, an improvement comprising the steps of: receiving input of said planning problem oriented constraint expressions; receiving input of initial variable values which satisfy said planning problem oriented constraint expressions; receiving input of one or more constraint expressions other than said planning problem oriented constraint expressions through manipulation of said planner to corresponding one or more of said graphics objects; and selecting as new variable values those which satisfy said planning problem oriented constraint expressions and said other constraint expressions, and also optimize predetermined criteria in terms of a current set of variable values.
Claim 10
Dependent Claim 47 words
A method according to claim 9 wherein said planner's manipulation includes manipulation for changing one or more target variable values to new values different from the current values, and manipulation for giving one or more new constraint expressions to one or more of said target variable values.
Claim 11
Dependent Claim 27 words
A method as claimed in claim 9 or 10 wherein display attributes are given to said graphics objects in accordance with sorts of said new constraint expressions.
Claim 12
Independent Claim 41 words
A method as claimed in any of claims 9 to 11 wherein said new constraint expressions include those accepting modification to larger values than current ones, those accepting modification to smaller values than current ones, and those fixing to current values.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag