Scribd
Upload
211 views3 pages

Advance LP

The document contains 14 sample questions for linear programming (LP) with multiple choice answers. The questions cover key LP concepts like objective functions, decision variables, constraints, feasibility, optimal solutions, slack variables, shadow prices, and graphical solution methods. They test understanding of the role of constraints in defining the feasible region and determining optimality as well as identifying infeasible, unbounded, and redundant constraints in LP problems.

Uploaded by

SubrataTalapatra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
211 views3 pages

Advance LP

The document contains 14 sample questions for linear programming (LP) with multiple choice answers. The questions cover key LP concepts like objective functions, decision variables, constraints, feasibility, optimal solutions, slack variables, shadow prices, and graphical solution methods. They test understanding of the role of constraints in defining the feasible region and determining optimality as well as identifying infeasible, unbounded, and redundant constraints in LP problems.

Uploaded by

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

Sample questions for LP:

1.

The maximization or minimization of a quantity is the


a.
goal of management science.
b.
decision for decision analysis.
c.
constraint of operations research.
d.
objective of linear programming.
ANSWER:
d
2.

Decision variables
a.
tell how much or how many of something to produce, invest, purchase, hire, etc.
b.
represent the values of the constraints.
c.
measure the objective function.
d.
must exist for each constraint.
ANSWER:
a
3.

Which of the following is a valid objective function for a linear programming problem?
a.
Max 5xy
b.
Min 4x + 3y + (2/3)z
c.
Max 5x2 + 6y2
d.
Min (x1 + x2)/x3
ASNWER:
b
4. Slack
a.
b.
c.
d.
ANSWER:

is the difference between the left and right sides of a constraint.


is the amount by which the left side of a < constraint is smaller than the right side.
is the amount by which the left side of a > constraint is larger than the right side.
exists for each variable in a linear programming problem.
b

5. To find the optimal solution to a linear programming problem using the graphical method
a.
find the feasible point that is the farthest away from the origin.
b.
find the feasible point that is at the highest location.
c.
find the feasible point that is closest to the origin.
d.
None of the alternatives is correct.
ANSWER:
d
6. The improvement in the value of the objective function per unit increase in a right-hand side is the
a.
sensitivity value.
b.
shadow price.
c.
constraint coefficient.
d.
slack value.
ANSWER:
b
7. Infeasibility means that the number of solutions to the linear programming models that satisfies all
constraints is
a.
at least 1.
b.
0.
c.
an infinite number.
d.
at least 2.
ANSWER:
b

8. A constraint that does not affect the feasible region is a


a.
non-negativity constraint.
b.
redundant constraint.
c.
standard constraint.
d.
slack constraint.
ANSWER:
b
9. All of the following statements about a redundant constraint are correct EXCEPT
a.
A redundant constraint does not affect the optimal solution.
b.
A redundant constraint does not affect the feasible region.
c.
Recognizing a redundant constraint is easy with the graphical solution method.
d.
At the optimal solution, a redundant constraint will have zero slack.
ANSWER:
d
10. All linear programming problems have all of the following properties EXCEPT
a.
a linear objective function that is to be maximized or minimized.
b.
a set of linear constraints.
c.
alternative optimal solutions.
d.
variables that are all restricted to nonnegative values.
ANSWER:
c
11. Use this graph to answer the questions.
15

10
B

II

III

D
V
IV
0
0

Max
s.t.

a.
b.

10

20X + 10Y
12X + 15Y
15X + 10Y
3X - 8Y
X, Y

<
<
<
>

15

180
150
0
0

Which area (I, II, III, IV, or V) forms the feasible region?
Which point (A, B, C, D, or E) is optimal?

c.
d.

Which constraints are binding?


Which slack variables are zero?

12. Maxwell Manufacturing makes two models of felt tip marking pens. Requirements for each lot of pens
are given below.
Fliptop Model
3
5
5

Plastic
Ink Assembly
Molding Time

Tiptop Model
4
4
2

Available
36
40
30

The profit for either model is $1000 per lot.


a.
b.
c.

What is the linear programming model for this problem?


Find the optimal solution.
Will there be excess capacity in any resource?

13. Does the following linear programming problem exhibit infeasibility, or unboundedness? Explain.
Min
s.t.

1X + 1Y
5X + 3Y
3X + 4Y
Y
X,Y

<
>
<
>

30
36
7
0

14. For the following linear programming problem, determine the optimal solution by the graphical
solution method. Are any of the constraints redundant? If yes, then identify the constraint that is
redundant.
Max

X + 2Y

s.t.

X+ Y < 3
X 2Y > 0
Y < 1
X, Y 0

You might also like