Scribd
Upload
10 views2 pages

Operational Research 2

Uploaded by

michiyan17
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
10 views2 pages

Operational Research 2

Uploaded by

michiyan17
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Janice H.

Rivera Operational Research 2


BSIE 3-2 Prof: Sir Jacob Dizon
ASSIGNMENT:
 NONLINEAR PROGRAMMING
In mathematics, nonlinear programming (NLP) is the process of solving an optimization
problem where some of the constraints or the objective function are nonlinear. An optimization
problem is one of calculation of the extrema (maxima, minima or stationary points) of
an objective function over a set of unknown real variables and conditional to the satisfaction of
a system of equalities and inequalities, collectively termed constraints. It is the sub-field
of mathematical optimization that deals with problems that are not linear.
 INTEGER PROGRAMMING
Integer programming is an area of constrained optimization that involves optimizing a linear LP
with the additional constraint that some or all variables are restricted to nonnegative integers.
Integer programming algorithms solve such problems by using LP relaxation, heuristic methods
and k-opt heuristics.
 DYNAMIC PROGRAMMING
Dynamic programming is a method of breaking down a large problem into smaller sub
problems that can be solved recursively or iteratively. The key idea is to store the results of the
sub problems in a table or a matrix, and use them to avoid repeated calculations and find the
optimal solution.
 SEQUENCING THEORY
Sequencing Theory can be defined as the selection of an order for a series of jobs to be done on
a number of service facilities(machine). In sequencing, a systematic procedure is adopted in
assigning priorities to waiting jobs thereby determining the sequence in which jobs will be
processed.
 MARKOVE PROCESS
The Markov analysis process involves defining the likelihood of a future action, given the
current state of a variable. Once the probabilities of future actions at each state are
determined, a decision tree can be drawn, and the likelihood of a result can be calculated.
 NETWORK SCHEDULING (PERT/CPM)
Network Scheduling is a technique used for planning and scheduling large projects in the fields
of construction, maintenance, fabrication, purchasing, computer system installation, research
and development designs, etc.

 SYMBOLIC MODEL
Symbolic Models or Mathematical Models: In these models the variables of a problem are
represented by mathematical symbols, letters etc. They explain all the features of the actual
object. In fact, a globe is an iconic model of the earth. These models may be of enlarged version
or reduced version.
 INFORMATION THEORY
Information theory is based on probability theory and statistics, where quantified information is
usually described in terms of bits. Information theory often concerns itself with measures of
information of the distributions associated with random variables.
 VALUE THEORY
Values pervade the field of operations research. Expressed as objectives, goals, criteria,
performance measures, and/or objective functions, they are necessary in theoretical operations
research models and in applications. Because of their critical role, it is useful to develop these
expressions of values from basic principles.

You might also like