IE 400: Principles of Engineering Management

Study Set 2
Fall 2023

Question 1. For the given LP below:

min 2x + y
s.t. − 3x + 4y ≥ 4
x≥0
y urs (free)
(a) Draw the feasible region.
(b) What is the optimum solution and optimal (optimum) solution value?
Question 2. For the given LP below:

min 6x + 10y
s.t. − 8x + y ≤ 13
3x + 5y ≥ 13
x≥0
y≥0

(a) Draw the feasible region.

(b) What is the optimum solution and optimal (optimum) solution value?
Question 3. There are 2 decision makers (DMs) with following objectives :
max −x + 2y (DM 1)
max 4x + 2y (DM 2)

1
and the feasible region is the following:

s.t. x + 2y ≤ 12
−x+y ≤4
4x − 3y ≤ 26
x≥0

(a) Draw the feasible region.

(b) Find the optimal solution and optimal solution value for each DM.

Question 4. For the given LP below:

min ax + by
s.t. x + 2y ≥ −4
− 3x + y ≤ 6
x≥0
y urs

(a) Draw the feasible region.

(b) Give an example for a and b such that LP will have a unique optimal
solution. For the chosen a and b, what is the optimal solution and
optimal solution value?
(c) Give an example for a and b such that LP will be unbounded.

Question 5. Consider the following linear programming problem (LP):

min c1 x − c2 y
s.t. x − 2y ≤ 4
−x+y ≤3
x≥0
y≥0

Find positive coefficients c1 and c2 such that LP will have a unique optimal
solution.

2
Question 6. For the given LP below :
max 7x + 5y
s.t. 4x + 5y ≥ −8
5x − 2y ≤ 20
− 3x + 8y ≤ b
x≥0
y≥0

(a) Give an example for b such that LP will have a unique optimal solution
value greater than 75.
(b) For the chosen b, draw the feasible region.
(c) For the chosen b, what is the optimal solution and optimal solution value?

Question 7. Identify the basic solutions and basic feasible solutions in the
following linear system.

x1 − x2 + 3x3 + 5x4 = 15
x1 + x2 + x4 = 9
xi ≥ 0 i = 1, · · · , 4
Question 8. Use the simplex algorithm to find two optimal solutions to the
following LP:
max 5x1 + 3x2 + x3
s.t. x1 + x2 + 3x3 ≤ 6
5x1 + 3x2 + 6x3 ≤ 15
xi ≥ 0 i = 1, 2, 3
Try to solve the same question with x3 as urs.
Question 9. Consider the following LP:
max 10x1 + 8x2 − 3x3 + 3x4
s.t. 2x1 + 4x2 − 0.5x3 + 0.5x4 ≤ 3
− 2x1 + 6x2 − 4.5x3 + 4.5x4 ≤ 7
x1 , x2 , x3 , x4 ≥ 0

3
Convert the LP in standard form. Then construct the tableau where x1 is
the basic variable in the first constraint and x4 is the basic variable in the
second constraint (order is important). Then, answer the following

(a) Is this a basic solution? Why?

(b) Is this a basic feasible solution? Why?

(c) Is this an optimal basic feasible solution? Why?

Question 10. Reatix must determine how much investment and debt to un-
dertake during the next year. Each TL invested reduces the net present value
(NPV) of the company by 10kr, and each TL of debt increases the NPV by
50kr (due to deductibility of interest payments). Reatix can invest at most 1
million TL during the coming year. Debt can be at most 40% of the invest-
ment. Reatix now has 800,000 TL in cash available. All investment must be
paid from current cash or borrowed money. Set up an LP that maximizes
the NPV of Reatix. Then, solve this LP by simplex method.

Question 11. Consider the following simplex tableau of a given minimiza-

tion LP problem.

Give general conditions on each of the unknowns A-F such that each of
the following statements is true. Even if the statement holds independently
of the values of a specific variable, you should still mention that variable.

(a) The tableau is final and there exists a unique optimal solution.

(b) The simplex method determines an unbounded solution from this tableau.

(c) The current bfs is degenerate (not necessarily optimal).

4
 (d) The current solution is optimal, there are alternative optimal solutions
but no alternative optimal bfs.

Question 12. Consider LP below:

max 3x1 + 4x2

s.t. 2x1 + 7x2 ≤ 11
x1 ≥ 0
x2 ≥ 0

(a) Draw the feasible region.

(b) Find the optimal solution

(c) Suppose that we add one more constraint to the LP. In such a case,
can optimal solution become bigger? Justify it, if it is possible if not
explain why.

Question 13. Consider LP below:

min ax1 + bx2

s.t. 4x1 + 3x2 ≤ 15
2x1 + x2 ≥ 3
x1 ≥ 0
x2 ≥ 0

(a) Find values for a and b so that optimal solution is alternate optimal
solution.

(b) For the a and b values that you found in a write an equation for alter-
nate optimal solution.

(c) Is there any a and b values that can create exactly two optimal solu-
tions?