info[at]proloq.org

Kateqoriya: Operations Research

Absolute Maximum

Absolute Minimum

Absorbing State

Activity Analysis Problem

Adjacent Extreme Point Methods

Admissible Basis

Alternative Optima

Analytic Hierarch Process (AHP)

Arc

Arrival And Service Processes

Arrival Rate Distribution

Artificial Basis

Artificial Variables

Artificial Vector

Assembly Line Balancing Problem

Assignment Problem

Augmented Matrix

Backpack Problem

Basic Feasible Solution

Basic Solution

Basic Variables

Basis

Basis Inverse

Basis Matrix

Basis Vector

Big M Method

Binding

Birth-And-Death Process

Block Pivot

Bounded Solution

Bounded Variable

Bounded Variable Problem

Branch and Bound Method

Branching Process

Brownian Process

Capacitated Transportation Problem

Caterer Problem

Chance Constrained Programming

Coefficient Matrix

Complementary Slackness Theorem

Computing Form

Concave Function

Concave Programming

Constant Arrival Rate Distribution

Constant Arrival Time

Constant Service Rate Distribution

Constant Service Time

Constraint

Constraint Matrix

Constraint Qualification

Contracting Cone Method

Convex Function

Convex Programming

Cost Coefficient

Cost Function

Cost Range

Cost Row

Cycling (Linear Programming)

Decision Variables

Decomposition Principle

Degenerate Solution

Delay

Derivative

Deterministic Model

Deviational Variables

Dichotomous Search

Diet Problem

Diophantine Programming

Discrete Variable Problem

Dual Linear Programming Problems

Dual Price

Dual Problem

Dual Simplex Algorithm

Duality Theorems for Linear Programming

Dynamic Programming

Either/Or constraints

Entering Variable

Ergodic Chain

Excess Variable

Exponential Service Time

Fair Game

Fathom

Feasible Basis

Feasible Region

Feasible Solution

Feasible Solution Set

Finite Games

Fractional Programming

Gambler’s Ruin

Game Theory

Geometric Programming

Geometric Solution

Goal Programming

Golden Section Search

Gradient Methods

Gradient of a Function

Hamiltonian Tour

Heuristic Programming

Hungarian Method

Hyperbolic Programming

Infeasible Basis

Inferior Solution

Infinite Games

Initial Basis

Initial Feasible Basis

Initial Solution

Integer Form

Integer Linear Programming

Integer Programming

Interarrival Time

Isocost Line

Isoprofit Line

Kendall’s Notation

Lagrange Multipliers

Leaving Variable

Lexicographic Approach

Lexicographic Ordering

Linear Constraint

Linear Model

Linear Programming

Linear Programming Problem

Linear System

Linking Constraints

Man-Function

Markov Chains

Mathematical Programming

Matrix Game

Max-Flow Min-Cut Theorem

Maximal Network Flow Problem

Mean Arrival Rate

Mean Service Rate

Minimal Cost Flow Problem

Minimax Principle

Mixed Integer Linear Programming

Mixed Integer Programming

Mixed Strategy

Monotone

Monotonic Decreasing Function

Monotonic Increasing Function

Multicommodity Network Problem

Multicriteria Optimization

Multiperson Game

Multiple Channels (in Queuing Theory)

Multiple Objective Decision Making

Multistage Queuing

N-Person Game

Near-Optimum Solution

Network Models

Node

Non-Linear Programming

Nonbasic Variable

Nonbinding

Nondegeneracy Assumption

Nondegenerate Feasible Solution

Nonlinear Constraint

Nonnegativity Constraint

Northwest Corner Rule

Objective Function

Objective Function Element

Objective Value

Operations Research

Output Node

Parametric Programming

Pareto Optimality (Non-Dominated Solution)

Partition

Payoff

Payoff Function

Payoff Matrix

Permanently Feasible Set

Personnel-Assignment Problem

Perturbation Techniques

Phase I

Phase II

Phase Process

Phase Queuing Model

Phase-Type Random Variable

Pivot Column

Pivot Element

Pivot Row

Pivot Step

Pivotal Method

Polynomial Programming

Positive Definite Quadratic Form

Positive Semi-Definite Quadratic Form

Preemptive Priority

Preemptive Service

Primal Problem

Primary Constraints

Prisoner’s Dilemma

Profit Range

Pruning

Pure Strategy

Quadratic Function

Quadratic Programming

Queue Discipline

Queuing Theory

Random Access (in Queuing Theory)

Ratio Test

Recursion

Reduced Cost

Resource Constraints

Revised Simplex Method

Secondary Constraints

Sensitivity Analysis

Sensitivity Testing

Separable Constraint

Separable Objective Function

Separable Programming

Sequential Optimization

Server

Shadow Price

Shortest Route Problem

Sign Restrictions

Simplex

Simplex Algorithm

Simplex Method

Simultaneous Optimization

Single-Server Queuing System

Singular Matrix

Slack

Slack Variable

Slack Vector

Standard Gamble

Starting Basis

Starting Solution

State

State Probability In Queuing Models

Stationary Point

Steady State

Stochastic Programming

Strictly Concave Function

Strictly Convex Function

Strictly Increasing Function

Strong Duality

Subroutine

Subsection

Subsequence

Subtour

Supporting Hyperplane

Surplus Variable

Symmetric Parametric Programming

Technological Coefficients

Technology Matrix (Technological Matrix)

Traffic Intensity

Transient State

Transition Matrix

Transportation Problem

Transshipment Problem

Traveling Salesman Problem (TSP)

Trim Problem

Unbounded Solution

Unboundedness

Unconstrained

Unique Optimal Solution

Unrestricted-in-Sign Variables

Upper Bound

Upper Bounded Linear Programming Problem

Value of a Game

Vehicle Routing Problem

Waiting Line (same as Queue)

Waiting Time

Weak Duality

Zero-Sum Two-Person Game (Matrix Game)

Menyu