Scribd
Upload
375 views3 pages

Practice Problem 2

This document contains 10 practice problems involving operations research techniques like linear programming and the simplex method. The problems involve using graphical and algebraic methods to analyze linear programming models, identify feasible regions and optimal solutions, and step through the simplex method. They provide examples of applying different OR techniques to solve a variety of optimization problems under various constraints.

Uploaded by

rajatchiku
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
375 views3 pages

Practice Problem 2

This document contains 10 practice problems involving operations research techniques like linear programming and the simplex method. The problems involve using graphical and algebraic methods to analyze linear programming models, identify feasible regions and optimal solutions, and step through the simplex method. They provide examples of applying different OR techniques to solve a variety of optimization problems under various constraints.

Uploaded by

rajatchiku
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/ 3

Operations Research

Practice Problem 2

(1) Use the graphical method to solve the problem:

(2) Consider the following problem, where the value of c1 has not yet been ascertained.

Use graphical analysis to determine the optimal solution(s) for (x1, x2) for the various possible
values of c1 (<c1<).

(3) Consider the following problem, where the value of k has not yet been ascertained. The solution
currently being used is x1 = 2, x2 = 3. Use graphical analysis to determine the values of k such that
this solution actually is optimal.

(4) Use the graphical method to demonstrate that the following model has no feasible solutions.

(5) Suppose that the following constraints have been provided for a linear programming model.

(a) Demonstrate that the feasible region is unbounded.


(b) If the objective is to maximize Z = -x1 +x2, does the model have an optimal solution? If so, find
it. If not, explain why not.
(c) Repeat part (b) when the objective is to maximize Z = x1 - x2.
(d) For objective functions where this model has no optimal solution, does this mean that there are
no good solutions according to the model? Explain. What probably went wrong when formulating
the model?

(6) Consider the following model:

(a) Use the graphical method to solve this model.


(b) How does the optimal solution change if the objective function is changed to Z = 40x1 + 70x2?
(c) How does the optimal solution change if the third functional constraint is changed to 2x1 + x2
15?

(7) Consider the following problem.

(a) Use the graphical method to solve this problem. Circle all the corner points on the graph.
(b) For each CPF solution, identify the pair of constraint boundary equations it satisfies.
(c) For each CPF solution, identify its adjacent CPF solutions.
(d) Calculate Z for each CPF solution. Use this information to identify an optimal solution.
(e) Describe graphically what the simplex method does step by step to solve the problem.

(8) Describe graphically what the simplex method does step by step to solve the following problem.

(9) Work through the simplex method (in algebraic form) step by step to solve the following
problem.
(10) Work through the simplex method step by step (in tabular form) to solve the following
problem.

You might also like