Universidad de Jaén

1.-  Linear programming

1.1. Operations Research. Introduction

1.2. The linear programming model

1.3. Graphical solution

1.4. Convex sets

1.5. Properties of the solutions of a linear programming model

1.6. Deriving solutions of the linear programming model

2.-  The Simplex method

2.1. The essence of Simplex method

2.2. Deriving an initial basic solution

3.-  The dual problem

3.1. Definition of the dual problem

3.2. Economic interpretation of duality

3.3. Dual Simplex algorithm

3.4. Post-optimal analysis

4.- Integer linear programming 

4.1. Integer linear programming problems

4.2. Integer linear programming algorithms

5.- Nonlinear programming 

5.1. General problems of mathematical programming

5.2. Mathematical foundations

5.3. Other programming methods

6.- Inventory models

6.1. Components of inventory models

6.2. Deterministic inventory models

6.3. Stochastic inventory models

The default teaching language will be Spanish. The sessions are structured in:

• Theoretical sessions, where the theoretical contents are developed and illustrated by some practical examples.
• Practical sessions, where the students have to solve problems and exercises, and they are trained to use some statistical software.

Tutorial support sessions, bibliography, additional materials and exams will be available in English. 

Students with special educational needs should contact the Student Attention Service (Servicio de Atención y Ayudas al Estudiante) in order to receive the appropriate academic support

The student final mark will be the weighted average of the marks obtained in the following items:

• A  final written exam, where the students will have to answer some short theoretical questions and solve some exercises (weight: 80%).
• In-class tests, where the students will have to solve some proposed exercises by using a statisitcal software to evaluate the acquisition of skills in the practical sessions (weight: 20%).