University of Southeastern Philippines

COLLEGE OF ARTS AND SCIENCES

Obrero, Davao City

Elect 3 – ELECTIVE 3 (OPERATIONS RESEARCH 1)

MIDTERM EXAMINATIONS

Name: __________________________________________ Score ______________

Course & Year: ___________________________________ Date: ______________

Part 1. True or False. Write True if the statement is correct. Otherwise, write False (2 points
each)

1. All LP problems with two decision variables has a feasible minimization and
maximization solution.
2. A "pivot" in a nonbasic column of an LP simplex tableau will make it a basic column.
3. In the Simplex algorithm, if an entering variable exists but a leaving variable does not
then it implies that the LP problem has no feasible solution.
4. In the Simplex algorithm, if a leaving variable exists but an entering variable does not
then the LP problem is said to have no feasible solution.
5. An LP that does not have a unique optimal solution must be either infeasible or
unbounded.
6. For an LP to be unbounded, it is necessary (but not sufficient) that all decision variables
should be able to increase without limit.
7. A basic solution of an LP is always feasible.
8. A feasible solution of an LP is always basic.
9. It is possible to find an LP with only two alternative optimal solutions.
10. If you increase the right-hand-side of a “greater-than-or-equal” constraint in a
minimization LP, the optimal objective value will either increase or stay the same.
11. The “reduced cost” in LP provides an estimate of the change in the objective value when
a right-hand-side of a constraint changes.
12. The optimal basic solution to an LP with m constraints (excluding nonnegativity
constraints) can have at most m positive decision variables.
13. If a zero appears on the right-hand-side of row i of an LP tableau, then at the next
simplex iteration you cannot pivot in row i.
14. When maximizing in the simplex method, the value of the objective function will not
improve at the next pivot if the current tableau is degenerate.
15. The dual variables computed during the solution of a transportation problem are always
nonnegative.
16. If a primal minimization LP problem has a cost which is unbounded below, then the dual
maximization problem has an objective which is unbounded above.
17. To be feasible, a set of values of the LP decision variables must satisfy at least one
constraint.
18. The dual of an LP problem is always a MAXIMIZE problem with “≤” constraints.
19. If an LP problem has 3 constraints (not including non-negativity) and 5 variables, then its
dual problem has 5 constraints (not including non-negativity) and 3 variables.
 20. An unbounded minimization LP problem is possible.

Part 2. Problem Solving. For each of the following problems, Formulate the LP Model and
determine the optimal solution using the indicated method. Write a legible detailed
solution and enclose your final answer (20 points each).

1. A fruit grower has 150 hectares of land available to raise two fruit crops, A and B. It takes
one day to trim an acre of crop A and two days to trim a hectares of crop B, and there are
240 days per year available for trimming. It takes 0.5 day to harvest a hectares of crop A
and 0.25 day to harvest a hectares of crop B, and there are 30 days per year available for
harvesting. Find the number of hectares of each fruit crops that should be planted to
maximize profit, assuming that the profit is Php 140k per acre for crop A and Php 235k per
hectares for crop B. Use the graphical method.

2. A manufacturer produces three models of bicycles. The time (in hours) required for
assembling, painting, and packaging each model is as follows.
Model A Model B Model C
Assembling 3 2 2.5
Painting 1 1.5 2
Packaging 1.25 1 0.75

The total time available for assembling, painting, and packaging is 4000 hours, 2495 hours
and 1500 hours, respectively. The profit per unit for each model is Php 450 (Model A),
Php 500 (Model B), and Php 550 (Model C). How many of each type should be produced
to obtain a maximum profit?

3. A small petroleum company owns two refineries. Refinery A costs Php 250,000 per day to
operate, and it can produce 300 barrels of high-grade oil, 200 barrels of medium-grade oil,
and 150 barrels of low-grade oil each day. Refinery B is newer and more modern. It costs
Php300,000 per day to operate, and it can produce 300 barrels of high-grade oil, 250 barrels
of medium-grade oil, and 400 barrels of low-grade oil each day. The company has orders
totaling 35,000 barrels of high-grade oil, 30,000 barrels of medium-grade oil, and 40,000
barrels of low-grade oil. How many days should the company run each refinery to minimize
its costs and still meet its orders?