Air force operations analysis
- PDF / 9,160,784 Bytes
- 44 Pages / 595.32 x 790.92 pts Page_size
- 90 Downloads / 215 Views
ACTIVE SET METHODS
A heuristic search procedure that selects a node in its search tree for expansion such that the selected node has minimum value of the sum of the cost to reach the node plus a heuristic cost value for that node, where the heuristic cost underestimates the true minimum cost of completion. See Artificial intelligence.
See Quadratic programming.
AHP See Analytic hierarchy process.
AI See Artificial intelligence.
ANP See Analytic network process.
ARIMA Autoregressive Integrated Moving Averages. See Time series.
ACCEPTANCE SAMPLING See Statistical quality control.
ACCOUNTING PRICES
ACTIVITY (1) A structural variable whose value (level) is to be computed in a linear programming problem. See Structural variables. (2) Project work items having specific beginning and completion points and durations. See Network planning; Project management.
ACTIVITY-ANALYSIS PROBLEM A linear-programming problem of the form Maximize ex, subject to Ax ::; b, x 2:: 0. The variables xi of the vector x are quantities of products to be produced. The bi coefficients of the resource vector b represent the amount of resource i that is available for production, the ci coefficients represent the value (profit) of one unit of output xi, and the coefficients aii of the technological matrix A represent the amount of resource i required to produce one unit of productj. The aii are termed technological or inputoutput coefficients. The objective function ex represents some measure of value of the total production. See Input-output analysis; Input-output coefficients; Linear programming.
ACTIVITY LEVEL The value taken by a structural variable in an intermediate or final solution to a linear programming problem. See Structural variables.
See Shadow prices.
ACYCLIC NETWORK ACCREDITATION See Model accreditation.
ACTIVE CONSTRAINT A constraint in an optimization problem that is satisfied exactly by a solution. See Inactive constraint; Slack variable; Surplus variable.
A network that contains no cycles. See Network optimization; Graph Theory.
ADJACENT Nodes of a graph or network are adjacent if they are joined by an edge; edges are adjacent if they share a common node. See Graph theory; Network optimization.
S. I. Gass et.al., (eds.), Encyclopedia of Operations Research and Management Science © Kluwer Academic Publishers 2001
2
Adjacent (neighboring) extreme points
ADJACENT (NEIGHBORING) EXTREME POINTS
tising elasticity for the brand is small and the advertising expenditures are responsive to sales increases of other brands. A very interesting feature of this model is that it has good forecasting properties. Two extreme points of a polyhedron that are conAs far as estimation technology is concerned, nected by an edge of the polyhedron. there are three works that have provided insightful results. Bass and Clarke (1972) showed that statistical models of sales-advertising relationship need not be limited to the Koyck (1954) model. For example, ADVERTISING nonmonotonic lag distributions are more appropriate for monthly data. B
Data Loading...
