|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Object | +--VirtualOrganization.VirtualOrganization
| Constructor Summary | |
VirtualOrganization(VirtualOrganization.DisplayController control)
Class constructor. |
|
| Method Summary | |
void |
addReq(java.lang.String name,
int x,
int y)
Add new Requirement. |
void |
addSat(java.lang.String name,
int x,
int y)
Add new Satisfier. |
void |
adjustConnections()
Adjust dynamicConnections after assignableConnections matrix has changed. |
boolean |
areAssignable(java.lang.String req,
java.lang.String sat)
Check if nodes are assignableConnections. |
boolean |
areStaticallyConnected(java.lang.String req,
java.lang.String sat)
Check if nodes are connected. |
void |
assignOptimalConnections()
Assign dynamicConnections after Linear Programming problem has been solved. |
void |
calculateDirectCost()
|
void |
calculateDynamicAssignmentCost()
Calculate assignment cost after Linear Programming problem has been solved.. |
void |
calculateDynamicTotalCost()
Calculate total cost after Linear Programming problem has been solved.. |
void |
calculateIndirectCost()
|
void |
calculateStaticAssignmentCost()
Get cost based on initial configuration. |
void |
calculateStaticTotalCost()
Calculate total cost after Linear Programming problem has been solved.. |
void |
calculateWeightedUnitCosts()
Calculate satisfiers' weighted unit costs. |
void |
deleteReq(int index)
Delete Requirement. |
void |
deleteSat(int index)
Delete Satisfier. |
void |
eraseAllNodes()
Delete all nodes. |
int |
findReq(java.lang.String name)
Find requirement index from requirements array. |
int |
findSat(java.lang.String name)
Find satisfier index from satisfier array. |
double |
getConnection(int req,
int sat)
Get connection. |
double |
getConnection(java.lang.String req,
java.lang.String sat)
Get connection. |
static double |
getRandom()
Generates random number. |
void |
initialize()
Initialize Virtual Organization problem. |
void |
initializeLinearProgrammingProblem()
Initialize LinearProgramming problem. |
boolean |
isSolvable()
Get after Linear Programming problem has been solved.. |
void |
optimize()
Optimize Virtual Organization problem. |
void |
removeReqSat()
Remove requirement or satisfier. |
void |
renameReq(java.lang.String oldname,
java.lang.String newname)
Rename Requirement. |
void |
renameSat(java.lang.String oldname,
java.lang.String newname)
Rename Satisfier. |
void |
reset()
Reset Virtual Organization problem. |
void |
setConnection(int req,
int sat,
double value)
Add dynamic connection. |
void |
setStaticConnection(java.lang.String req,
java.lang.String sat,
double value)
Add initial connection. |
void |
solveLinearProgrammingProblem()
Solve Linear Programming problem and assign dynamicConnections. |
void |
staticLinearProgrammingProblem(int r)
|
void |
updateLinearProgrammingProblem()
Update LinearProgramming problem. |
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
public VirtualOrganization(VirtualOrganization.DisplayController control)
| Method Detail |
public int findReq(java.lang.String name)
name - Requirement name
public int findSat(java.lang.String name)
name - Satisfier name
public void addReq(java.lang.String name,
int x,
int y)
name - Requirement namex - x-coordinatey - y-coordinate
public void addSat(java.lang.String name,
int x,
int y)
name - Requirement namex - x-coordinatey - y-coordinatepublic void deleteReq(int index)
index - Requirement indexpublic void deleteSat(int index)
index - Satisfier index
public void renameReq(java.lang.String oldname,
java.lang.String newname)
oldname - Requirement's old name
public void renameSat(java.lang.String oldname,
java.lang.String newname)
oldname - Satisfier's old name
public double getConnection(int req,
int sat)
req - Requirement's indexsat - Satisfier's index
public double getConnection(java.lang.String req,
java.lang.String sat)
req - Requirement's namesat - Satisfier's name
public void setConnection(int req,
int sat,
double value)
req - Requirement's indexsat - Satisfier's indexvalue - Connection value (0.0-1.0)
public void setStaticConnection(java.lang.String req,
java.lang.String sat,
double value)
req - Requirement's namesat - Satisfier's namevalue - Connection value (0.0-1.0)
public boolean areStaticallyConnected(java.lang.String req,
java.lang.String sat)
req - Requirement's namesat - Satisfier's name
public boolean areAssignable(java.lang.String req,
java.lang.String sat)
req - Requirement's namesat - Satisfier's name
public void adjustConnections()
public void initialize()
public void optimize()
public void initializeLinearProgrammingProblem()
public void updateLinearProgrammingProblem()
public void staticLinearProgrammingProblem(int r)
public void solveLinearProgrammingProblem()
public boolean isSolvable()
public void assignOptimalConnections()
public void calculateDynamicAssignmentCost()
public void calculateDynamicTotalCost()
public void calculateStaticAssignmentCost()
public void calculateStaticTotalCost()
public void calculateWeightedUnitCosts()
public void calculateIndirectCost()
public void calculateDirectCost()
public void removeReqSat()
public static double getRandom()
public void eraseAllNodes()
public void reset()
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||