Goal seeking

This article is an orphan, as few or no other articles link to it. Please introduce links to this page from other articles related to it. (February 2009)

This article does not cite any references or sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (January 2009)

In computing, goal seeking is the ability to calculate backward to obtain an input that would result in a given output. This can also be called what-if analysis or back-solving. It can either be attempted through trial and improvement or more logical means. Basic goal seeking functionality is built into most modern spreadsheet packages such as Microsoft Excel.

Examples

Suppose a family wanted to take out the biggest loan that they could afford to pay for. If they set aside $500 dollars a month, the goal-seeking program would try to work out how big a loan the family could afford to take out. Even using simple trial and improvement, a computer could quickly determine that they could not afford $50,000 loan, but could afford a $48,000 loan. It would then become repeat the process until it had reached a figure such as $48,476.34, which would give them a monthly repayment as close to, but not exceeding, $500, as possible.

A more efficient method, especially on more complicated calculations, would be for the program to logically work through the argument. By drawing up a simple equation, the program could come to the conclusion that the output equalled one ninety-sixth of the input, and could then multiply the output (or goal) by ninety-six to find the necessary input.

See also

• Global optimization
• Goal programming

 This computer programming-related article is a stub. You can help Wikipedia by expanding it.