0% found this document useful (0 votes)
25 views2 pages

Bop Midterm-2022

This document contains a midterm examination for a linear programming course. It includes multiple choice questions testing concepts of LP modeling and solution methods. It also includes several word problems to model as linear programs involving minimizing costs subject to capacity and scheduling constraints for hiring temporary workers. The problems require graphically representing feasible regions, determining basic feasible solutions, identifying inactive constraints, and modifying LP formulations to incorporate additional constraints.

Uploaded by

Amine Benattouch
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
25 views2 pages

Bop Midterm-2022

This document contains a midterm examination for a linear programming course. It includes multiple choice questions testing concepts of LP modeling and solution methods. It also includes several word problems to model as linear programs involving minimizing costs subject to capacity and scheduling constraints for hiring temporary workers. The problems require graphically representing feasible regions, determining basic feasible solutions, identifying inactive constraints, and modifying LP formulations to incorporate additional constraints.

Uploaded by

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

University of Tunis Spring 2022

Tunis Business School

Linear Programming
Midterm Examination

Question 1: Multiple choice questions (20 points)

Q1: The graphical method can be applied to  All of the above


solve a LP when there are only ‐‐‐‐‐‐‐‐‐‐‐‐‐
Q5: A LP model is based on the
variable(s)
assumptions of ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
 One
 Proportionality
 More than One
 Additivity
 Two
 Certainty
 Three
 All of the above
Q2: A minimization problem can be
Q6: ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ assumption means the
converted into a maximization problem by
prior knowledge of all the coefficients in the
changing the sign of coefficients in the ‐‐‐‐‐
objective function, in the constraints and in
‐‐‐‐‐‐‐‐‐‐‐‐‐‐
the resource values.
 Constraints (A)
 Proportionality
 Objective Function (B)
 Certainty
 Both A and B
 Finite choices
 None of the above
 Continuity
Q3: In a LP, if the solution of a variable can
Q7: A set of values X1, X2,…Xn which
be made infinitely large without violating
satisfies the constraints of the LP is called ‐
the constraints, the solution is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
‐‐‐‐‐‐‐‐‐‐‐
‐‐‐
 Solution
 Infeasible
 Variable
 Unbounded
 Linearity
 Alternative
 None of the above
 None of the above
Q8: A basic solution which satisfies the
Q4: An optimization model
non-negativity constraint is called ‐‐‐‐‐‐‐‐‐‐‐
 Mathematically provides the best ‐‐‐‐‐
decision
 A Basic feasible solution
 Provides the best decision within its
limited context  A Feasible solution
 An Optimal solution
 Constantly helps in evaluating
various alternatives  None of the above

1
Question 2 (15 points)
Consider the following problem:
Min Z = -X – 2Y
s.t. X+Y ≤ 4 (1)
2X+Y ≤ 6 (2)
X≥0
Y≥0

1. Provide a graphical representation of the feasible region.


2. Determine the basic feasible solutions
3. Provide the optimal solution
4. At optimality, which constraint is inactive?
Question 3 (15 points)
Consider the following LP
Max Z= 2X1+3X2+X3
s.t. X1+X2+X3 ≤6
X1+X2 ≤4
X3 ≤3
X1 ,X2 ,X3 ≥0

1. Use the simplex method to solve it


2. Identify the inactive constraint(s)

Question 4 (50 points):


Considering the upcoming of the holy month of Ramadan, Olina company decided to hire
temporary workers for 5 days to overcome the expected peak in demand. Each worker can work
either 2 consecutive days or 3 consecutive days. At least 10 workers are needed on days 1, 3
and 5, while at least 15 workers are needed on days 2 and 4. A worker who performs 2
consecutive days is paid 125 dinars per day, while a worker who performs 3 consecutive days
is paid 100 dinars per day. A worker who performs 2 days cannot start on day 5 and a worker
who performs 3 days cannot start on days 4 and 5. Olina wants to minimize the cost.
1. Model the problem as a LP. Do not solve.
2. Due to a shortage in the supervisory staff, no more than 10 workers can start each day.
Modify the LP formulation accordingly.
3. Work regulations require that at least half the money is spent on workers who work 3
days. Modify the LP original formulation accordingly.
4. There are four workers who want to work on days 1, 2 and 5. These workers will get
paid as if they work for 3 consecutive days. Modify the LP original formulation
accordingly.

You might also like