What are the uses of operation research?

Uses of operations research

 Scheduling and time management.
 Urban and agricultural planning.
 Enterprise resource planning (ERP) and supply chain management (SCM).
 Inventory management.
 Network optimization and engineering.
 Packet routing optimization.
 Risk management.

What Is a Decision Tree?

A decision tree is a type of supervised machine learning used to categorize or make
predictions based on how a previous set of questions were answered. The model is
a form of supervised learning, meaning that the model is trained and tested on a set
of data that contains the desired categorization. 

The decision tree may not always provide a clear-cut answer or decision. Instead, it
may present options so the data scientist can make an informed decision on their
own. Decision trees imitate human thinking, so it’s generally easy for data
scientists to understand and interpret the results.

How Does the Decision Tree Work?

Before we dive into how a decision tree works, let’s define some key terms of a decision tree.

 Root node: The base of the decision tree.

 Splitting: The process of dividing a node into multiple sub-nodes.
 Decision node: When a sub-node is further split into additional sub-nodes.
 Leaf node: When a sub-node does not further split into additional sub-
nodes; represents possible outcomes.
 Pruning: The process of removing sub-nodes of a decision tree.
 Branch: A subsection of the decision tree consisting of multiple nodes.

A decision tree resembles, well, a tree. The base of the tree is the root node. From
the root node flows a series of decision nodes that depict decisions to be made.
From the decision nodes are leaf nodes that represent the consequences of those
decisions. Each decision node represents a question or split point, and the leaf
nodes that stem from a decision node represent the possible answers. Leaf nodes
sprout from decision nodes similar to how a leaf sprouts on a tree branch. This is
why we call each subsection of a decision tree a “branch.” Let’s take a look at an
example for this. You’re a golfer, and a consistent one at that. On any given day
you want to predict where your score will be in two buckets: below par or over par.

Difference between Slack, Surplus and

Artificial variables | Slack vs. Surplus
vs. Artificial Variables
Poonam Dhanvani March 31, 2014 Difference between Slack, Surplus and Artificial variables | Slack vs. Surplus vs.
Artificial Variables2016-06-06T10:20:24+00:00Difference Between

Slack Variables : 
Slack variable represents an unused quaintly of  resources ; it is added to less than
or equal (<) to type constraints in order to get an equality constraint.
Surplus  Variables :
A surplus variable represents the amount by which solution values exceed a
resource. These variables are also called ‘Negative Slack Variables’ . Surplus
 variables like slack variables carry a zero coefficient in the objective function. it is
added to greater than or equal to (>) type constraints in order to get an equality
constraint.
Artificial Variables : 
  Artificial variables are added to those constraints with equality (=) and greater
than or equal to ( > ) sign. An Artificial variable is added to the constraints to get
an initial solution to an LP problem. Artificial variables have no meaning in a
physical sense and are not only used as a tool for generating  an initial solution to
an LP problem.
Particulars
Slack Variable Surplus Artificial Variable
Variable
Mean Unused resources of the idle Excess amount of resources No physical or economic meaning. It is
resources. utilized. Fictitious.

When used ? With <  Constraints With >  Constraints With > And = constraints

Coefficient +1 -1 +1

Co-efficient in 0 0 -M for Maximization and

the Z – objective +M for minimization
function

As Initial Program Used as starting point. Can’t be used since unit It is initially used but later on eliminated.
variable matrix condition is not
satisfied

In Optimal Table Used to help for interpreting – It indicates the Infeasible Solution
idle & key resources.

SADDLE POINT
In mathematics, a saddle point or minimax point is a point on the surface of the graph of a
function where the slopes (derivatives) in orthogonal directions are all zero (a critical
point), but which is not a local extremum of the function.