Consumption functionIn economics, the consumption function describes a relationship between consumption and disposable income. The concept is believed to have been introduced into macroeconomics by John Maynard Keynes in 1936, who used it to develop the notion of a government spending multiplier. Its simplest form is the linear consumption function used frequently in simple Keynesian models: where is the autonomous consumption that is independent of disposable income; in other words, consumption when disposable income is zero.
Failure causeFailure causes are defects in design, process, quality, or part application, which are the underlying cause of a failure or which initiate a process which leads to failure. Where failure depends on the user of the product or process, then human error must be considered. A part failure mode is the way in which a component failed "functionally" on the component level. Often a part has only a few failure modes. For example, a relay may fail to open or close contacts on demand.
Marginal propensity to consumeIn economics, the marginal propensity to consume (MPC) is a metric that quantifies induced consumption, the concept that the increase in personal consumer spending (consumption) occurs with an increase in disposable income (income after taxes and transfers). The proportion of disposable income which individuals spend on consumption is known as propensity to consume. MPC is the proportion of additional income that an individual consumes. For example, if a household earns one extra dollar of disposable income, and the marginal propensity to consume is 0.
Complexity of constraint satisfactionThe complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction problems on finite domains. Solving a constraint satisfaction problem on a finite domain is an NP-complete problem in general. Research has shown a number of polynomial-time subcases, mostly obtained by restricting either the allowed domains or constraints or the way constraints can be placed over the variables.
