Explore tens of thousands of sets crafted by our community.
Operations Research Techniques
8
Flashcards
0/8
Linear Programming
A mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.
Integer Programming
A mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. It's mostly used when the decision variables are required to be discrete.
Dynamic Programming
A method for solving complex problems by breaking them down into simpler subproblems. It is applicable to problems exhibiting the properties of overlapping subproblems and optimal substructure.
Network Flows
Algorithms used to solve problems related to flows in networks. It determines the optimal path and flow through a network that leads to the desired outcome such as the maximum flow or lowest cost.
Branch and Bound
An algorithmic method to solve optimization problems. It systematically enumerates candidate solutions by means of a state space search: the set of candidate solutions is thought of as forming a rooted tree.
Simulation
A technique to model the operation of a system or process through the use of a computer program that runs a model of the system to study its behavior over time.
Queuing Theory
A mathematical study of waiting lines or queues. This theory can help predict queue lengths and waiting times, which is useful for designing more efficient queue systems.
Heuristic Methods
Approach to problem solving that employs a practical method not guaranteed to be optimal but sufficient for reaching an immediate, short-term goal or approximation. Commonly used for complex optimization problems.
© Hypatia.Tech. 2024 All rights reserved.
