Optimización

Lineal
Método gráfico

Creado por:
Daniel Felipe Ramirez
Duvan Joel Rodriguez
Scharon Michel Rodriguez
Esteban Ortiz Mercado

SEPTEMBER 15, 2022

Exercise 1

1
The dean of a certain university must plan the school's courses for the next semester.
Student demand makes necessary to offer at least 30 undergraduate and 20 graduate
courses per semester. Faculty contracts state that at least 60 courses will be offered in
total. Each undergraduate course costs the university an average of $2,500 in faculty
salaries, and each graduate course costs to the university $3,000. How many
undergraduate and graduate courses should be offered in the fall so that total faculty
salaries are minimized?

a) Formulate as a linear programming model, including definition of sets,

parameters, variables, objective function and constraints.

Undergraduate: 30

graduate:20

total number of courses offered: 60

Salaries: $2500U + $3000G

Variables

X1= undergraduate

X2= graduate

Objective Function

Min Z= 2.500X1 + 3000X2

Restrictions

X1 >= 30

X2 >= 20

X1 + X2 >= 60

b) Solve the model using the graphical method (manual)

2
c) Present results and analysis of the obtained solution.

The minimum for undergraduates is 30 and for graduates is 20 in other words 30 + 20 =

50.

The minimum course should be 60 based on the Restriction and as the undergrade is the
cheapest we add the 10 courses that are needed so in the end the undergraduate courses
are X1 = 40 , and the graduate courses are X2 = 20 .

This is the result of a minimum cost of $160000 .Conclusion: From the solver output, the
number of undergraduate courses should be X = 40 , and the number of graduate courses
should be Y = 20 . This will lead to a minimum cost of $ 160000 .

Exercise 2

Considering the graph, you must choose the corresponding option for each model:

3
a) An unbounded area: Exercise 2

4
b) An infeasible model: Exercise 1

5
c) A proper formulation: Exercise 4

6
 d) Multiple solutions: Exercise 3

Formulation 1 Formulation 2

7
Maximize Z = 10X1 + 10X2 Maximize Z = 3X1 +2X2

2X1 ≤ 10 X1 + X2 ≥ 5

2X1 + 4X2 ≤ 16 X1 ≥ 2

4X2 ≤ 8 2X2 ≥ 8

X1 = 6

X1, X2 ≥ 0

X1, X2 ≥ 0

Formulation 3 Formulation 4

Maximize Z = X1 + 2X2 Maximize Z = 3X1 + 3X2

X1 ≤ 1 4X1 + 6X2 ≤ 48

2X2 ≤ 2 4X1 + 2X2 ≤ 12

X1+2X2 ≤ 2 3X2 ≥ 3

2X1 ≥ 2

X1, X2 ≥ 0

X1, X2 ≥ 0

Exercise 3

Deduce the inequalities (constraints) that make up the area of feasible solutions presented
in the graph:

8
9