Chebyshev goal programming can be considered as a specific form of the weighted goal programming approach. It seeks the solution that minimizes the worst unwanted deviation from any single goal. In this case, instead of using subjective notions to set the aspiration levels for the objectives, a set of single optimization problems is solved to arrive at the “best” and “worst” possible values of each objective. The best values are then used as aspiration levels for the objectives. The objective then becomes to minimize the deviation from those aspiration levels so that the worst deviation from any single-goal aspiration level is mimimized.
Graphical Ontology Browser
- Click on a node to jump to the content of that node
- Pan to see the rest of the graph
- Scroll the mousewheel up and down to zoom in and out
- Rearrange the nodes in the graph by dragging a node to a different position