Documente Academic
Documente Profesional
Documente Cultură
Solution.
Feasible region.
Infeasible region.
Maximum profit region.
None of the above.
2. Using the graphical solution procedure to solve a maximization problem requires that we
o
o
o
o
o
Move the level profit line up until it no longer intersects with any constraint equation.
Move the level profit line down until it no longer intersects with any constraint
equation.
Apply the method of simultaneous equations to solve for the intersections of
constraints.
Find the value of the objective functions at the origin.
None of the above.
A maximization function
A nonlinear maximization function
A quadratic maximization function
An uncertain quantity
A divisible additive function
4. Apply linear programming to this problem. A one-airplane airline wants to determine the best mix of
passengers to serve each day. The airplane seats 25 people and flies 8 one-way segments per day. There
are two types of passengers: first class (F) and coach (C). The cost to serve each first class passenger is
$15 per segment and the cost to serve each coach passenger is $10 per segment. The marketing
objectives of the airplane owner are to carry at least 13 first class passenger-segments and 67 coach
passenger-segments each day. In addition, in order to break even, they must at least carry a minimum of
110 total passenger segments each day. Which of the following is one of the constraints for this linear
program?
o
o
o
o
o
15 F + 10 C => 110
1 F + 1 C => 80
13 F + 67 C => 110
1 F => 13
13 F + 67 C =< (80/200)
6. Which of the following is an essential condition in a situation for linear programming to be useful?
o
o
o
o
o
Nonlinear constraints
Bottlenecks in the objective function
Homogeneity
Uncertainty
Competing objectives
8. The following five inequalities define a feasible region. Which one of these could be removed from
the list without changing the region? (Find redundant constraint)
o
o
o
o
o
x - 2y -8
y0
-x + y 10
x + y 20
x0
10. A juice company sells three varieties of drink. The last straw (L) contains 4 ounces of apples (a), 2
ounces of blueberries (b), and 6 ounces of strawberry (s). The blue group (B) contains 2 ounces of
apples, 6 ounces of blueberries, and 4 ounces of raspberries (r). The uniform (U) contains 3 ounces each
of apples, blueberries, strawberries, and raspberries. The store can sell a 12 ounce serving of L for $6.00;
a 12 ounce serving of B for $ 5.00; and a 12 ounce serving of U for $4.00. Let xi represent the number of
12 ounce servings of juice i sold for i = L, B, U. Let x0 denote the objective function (the revenue
generated from the sale of xi servings of juice i at given prices). Let yj equal the number of ounces of fruit
j used in the production for j = a, b, s, r. The juice seller wants to find xL, xB, and xU to maximize the
revenue assuming that the available supply of apples is Sa ounces, the available supply of blueberries is
Sb ounces, the available supply of strawberries is Ss ounces, and the available supply of raspberries is Sr
ounces. Which of the constraints below is consistent with this information?
o
o
o
o
o
yr Sr
x0 = 6xL + 5xB + 4xU
xL + xB + xU = ya + yb + ys + yr
xL = 4ya + 2yb + 6ys
ys = 6xL + 3xU
11. A statement that of two quantities one is specifically less than or greater than another. Symbols: < or
or > or , as appropriate.
o
o
o
o
inequality
expression
linear equation
real numbers
12. For the following system of linear inequalities, which of the following points falls in the shaded
region: 2x-3y<12, x+5y<20, x>0?
o
o
o
o
(2,6)
(6,-2)
(2,-6)
(6,2)
13. Why would one choose to solve a system of inequalities using a non-graphical method?
o
o
o
o
14. Find the maximum value of z=3a+2b+4c subject to the following constraints: 3a+2b+5c18,
4a+2a+3c16, and 2a+b+c4.
o
o
o
o
z=18
z=16
z=17
z=19
15. If the solution contains a variable that has a value of zero the problem is
o
o
o
o
Infeasible.
Unbounded.
Degenerate.
None of the above
16. In a maximization problem, if a constraint is of the 'greater than or equal to' type, the artificial
variable is assigned:
o
o
o
o
17. Which of the following statements is true about a primal linear programming and its corresponding
dual:
o
o
o
o
The optimal value for the primal is greater than that of the dual.
The shadow prices of the primal at optimality are the values of the Structural variables of the
dual at optimality.
Each problem does not have a dual.
Both the primal and the dual are either maximization or minimization problems
18. The outgoing variable in a simplex pivot operation is the variable with:
o
o
o
o
19. The feasible region represented by the constraints : x1+ x2 <= 1 , 3x1+ x2 >= 3 , x1,x2 >= 0 for the
objective function Z=x1+2x2 is:
o
o
o
o
Unbounded
Polygon
Alternate Optimal Solution
Infeasible
4
1
3
1. x1+2x2<=5
2.
None of these
21. For a set of m equation in n variables(n>m), a solution obtained by setting (n-m) variables equal to
zero and solving for remaining m equations in n variables is called as.
o
o
o
o
Feasible solution
Non Feasible Solution
Basic Feasible Solution
Basic Solution
22. The method for dealing with linear programming problems involving artificial variables is
o
o
o
o
23. For a maximization type of LPP, ____ property occurs where there is no constraint on the solution so
that one or more of the decision variable can be increased indefinitely without violating any of the
restrictions (constraints).
o
o
o
o
Un boundedness
Infeasibility
Alternate optimal solution
Simplex