WORK ABOUT OPERATIONS RESEARCH"CONCEPTS"

ROQUE RAMON GUERRA RAMOS

KAROL DANIELA GOMEZ TAMARA

AURA MARIA CANTILO OLIVERA

JESS DAVID LUJN PUELLO

LAURA VARGAS MONTOYA

LAURA DE VOZ AMAYA

LUISA VITOLA

STUDENTS

MYSAEL CRUZ MONRROY

PREFESSOR

UNIVERSIDAD TECNOLOGICA DE BOLIVAR

FACULTY OF ENGINEERING

INDUSTRIAL ENGINEERING PROGRAM

CARTAGENA DE INDIAS

2017

1
INDEX

1. Introduction 3
2. Objectives 4

Definitions

3. Operations research 5
4. Main areas IO modern 5
5. Linear Programming 6
6. Decision variables, slack, excess 6
7. F.O 6
8. Basic solutions, basic solutions feasible and infeasible 7
9. Optimal solution... 7
10. Special Solutions. 7
11. Conclusion 8
12. Bibliography.. 9

INTRODUCTION

2
It is increasingly difficult to allocate resources or activities in the most effective way,
as resources become increasingly scarce and complexities of systems grow,
generating problems for optimal decisions.

In the last century, the organizations of the world were only made up of a small
number of people and were run by one person. This whole panorama changes
radically with the First Industrial Revolution. As is known, this brought with it the
energy, machinery and equipment that revolutionized industries by mechanizing
production.

In this way, the model created for this type of situation arose, which is now known
as RESEARCH OF OPERATIONS.

3
GENERAL OBJECTIVES

Achieve the ability to solve operational problems by applying scientific

methodologies and developing computer applications for problem solving.

SPECIFIC OBJECTIVES

Understand the concept of operations research

Know the areas of study of operational research
Understand the historical development of IO as a science
Analyze, understand and interpret the types of solutions that this poses, be
it decision, slack and excess.

4
DEFINITIONS

3. INVESTIGATION OF OPERATIONS

Operations research is the attack of modern science on the complex problems that
arise in the management and administration of large systems of men, machines,
materials and money, in industry, in business, in government and in defending.
Their differential attitude consists in developing a scientific model of the system
that incorporates assessments of factors such as chance and risk and through
which the results of alternative decisions, strategies or controls are predicted and
compared. Its purpose is to help management to scientifically determine its policies
and actions.

4. MAIN AREAS OF THE MODERN IO

A sample of the problems that the IO has studied and successfully solved in main
business and industry of the modern IO has the following:

Personnel: Automation and cost reduction, recruitment of personnel,

classification and assignment to tasks of better performance and incentives
to production.
Market and distribution: Product development and introduction, packaging,
demand forecasting and competitor activity, location of warehouses and
distribution centers.
Purchases and materials: Amounts and sources of supply, fixed and variable
costs, replacement of materials, replacement of equipment, purchase or
rent.
Manufacturing: Production planning and control, optimum manufacturing
blends, plant location and size, material traffic and quality control.
Finance and accounting: Cash flow analysis, long-term capital requirements,
alternate investments, safety sampling on audits and claims.
Planning: With Pert methods to control the progress of any project with
multiple activities, both simultaneous and those that must wait to be
executed

5. LINEAR PROGRAMMING

The Linear Programming corresponds to an algorithm through which real situations

are solved in which it is tried to identify and to solve difficulties to increase the
productivity with respect to the resources (mainly the limited and expensive ones),
thus increasing the benefits. The primary objective of Linear Programming is to
optimize, ie, to maximize or minimize linear functions in several real variables with
linear constraints (linear inequality systems), optimizing a linear function as well.

5
The results and the optimization process become a quantitative support of the
decisions against the situations posed.

6.

DETERMINATION VARIABLES
The decision variables are unknowns that must be determined from the
solution of the model. The parameters represent known system values or
can be controlled.
SLEEVE VARIABLES
They are variables that are added to the constraint so that the relation of the
constraint is equal (represents the value that is needed on the left side to be
equal to the right side). Both types of variables have to comply with the non-
negativity constraint
EXCESSIVE VARIABLES
The Simplex Method works based on equations and the initial constraints
that are modeled by linear programming are not, for it is necessary to
convert these inequations into equations using variables called looseness
and excess

7. OBJECTIVE FUNCTION

The objective function is the equation that will be optimized given the limitations or
constraints and with variables that need to be minimized or maximized using linear
or nonlinear programming techniques. The objective function is subject to a series
of constraints, expressed by linear inequalities.

8. SOLUTIONS

BASICS
For a system of m equations and n variables in which n> m, if a solution
exists, it can be found by equalizing n-m of the variables to zero and solving
the resulting set of m equations with m variables. Variables that equal zero
are called non-basic variables; The variables used to solve the equations
are called basic variables. A basic solution is an endpoint.
FACTIBLES
A Basic Feasible Solution (SBF) is one that in addition to belonging to the
feasible area or area of the problem can be represented through a feasible
solution in the application of the Simplex Method satisfying the non-
negativity conditions.
INFEASIBLE

6
 Restrictions cover different search spaces and there is no feasibility region
for the overall problem.

9. OPTIMAL SOLUTION

It is a feasible solution that has the most favorable value of the objective function. If
there is a feasible solution, there is a feasible basic solution.

10. SPECIAL SOLUTIONS

In the resolution of a Linear Programming model, certain special cases can be

addressed that deserve particular attention. These cases (infinite optimal solutions,
unbounded problem without optimum solution, infeasible problem, optimized
degenerate solution) can be detected through the application of the Simplex
Method as previously discussed in the Blog. Below is a summary of these
scenarios:

Infinite Optimal Solutions: It is detected that after reaching an optimal

feasible basic solution, at least one non-basic variable has a reduced cost
equal to zero. The following image represents this situation where the
optimal (infinite) solution is reached in the section between the vertices B
and C. In fact, it is possible to represent in a general way the optimal
solution.

CONCLUSION

7
It was possible to conclude and to understand that the ability to solve operational
problems is solved by applying scientific methodologies and developing computer
applications management so that the problems raised can be successfully
developed.

Besides that in the investigation of operations is used Linear Programming

corresponds to an algorithm through which real situations are solved in which it is
tried to identify and to solve difficulties to increase the productivity with respect to
the resources (mainly the limited and expensive ones), increasing Thus the
benefits, as well as restrictions among others.

BIBLIOGRAPHIES

8
 http://www.ditutor.com/programacion_lineal/programacion_lineal.html
http://www.gestiondeoperaciones.net/programacion_lineal/que-es-la-
investigacion-de-operaciones/
http://www.gestiondeoperaciones.net/programacion_lineal/que-es-una-
solucion-basica-factible-en-programacion-lineal/
https://www.fing.edu.uy/inco/cursos/io/archivos/teorico/todo.pdf