✨

True or False
True 1. In a linear programming problem, the objective function and the constraints must
be linear functions of the decision variables
False 2. The maximization or minimization of a quantity is the objective of forecasting
False 3. In a linear programming problem, the objective function and the constraints must
be nonlinear functions of the decision variables
True 4. The constraint 5xsub1 - 2xsub2 <= 0 passes through the point (20, 50)
True 5. An optimal solution to a linear programming problem can be found at an extreme
point of the feasible region for the problem.
True 6. A network uses nodes and arcs to represent geographical locations and the units
transferred between them
False 7. In network models the number of arcs determines the number of constraints
- Should be number of nodes determines the number of constraints
True 8. If a transportation problem has four origins and five destinations, the LP
formulation of the problem will have nine constraints
False 9. In general assignment problem, one agent can be assigned to several tasks
False 10. In assignment problems, dummy agents or tasks are created when the number
of agents and tasks is equal.
II
1. Which of the following is true about maximization or minimization of a quantity?
: Objective of Linear Programming
2. Which of the following best describe the decision variables?
: tell how much or how many of something to produce, invest, purchase, hire, etc
3. Which of the following refers to the linear inequalities or equations or restrictions on
the variables of a linear programming problem?
: constraints
4. Which of the following is a valid objective function for a linear programming
problem?
: Min 4x + 3y + (2/3)z
 5. Let M be the number of units to make, and B be the number of untis to buy. If it costs
$2 to make a unit and $3 to buy a unit and 4000 units are needed, then which
presents the objective function?
: Min: 2M + 3B
6. Apply linear programming to this problem.
A one-airplane airlines wants ot 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 ocst to serve each first class passenger
is 15 dollars per segment and the cost to searve each coach passenger is 10 dollars per
segment. The marketing objective 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. Whcih of the following is one of the constraints for this linear program?
: F >= 13
7. For the LP problem, Minimize z = 2x + 3y the coordinates of the corner points of the
bounded feasible region are A(3,3), B(20,3), C(20,10), D(18,12), and E(12,12). What is
the minimum value of z?
: 15
8. The sanders Garden shop mixes two types of grass seed into a blend. Each type of
grass has been rated (per pound) according to its shade tolerance, ability to stand
up to traffic, and drought resistance, as shown in the table. Type A seed costs $1
and Type B seed costs $2. If the blend needs to score at least 300 points for shade
tolerance, 400 points for traffic resistance, and 750 points for droughts resistance,
how many pounds of each seed should be in the blend? Which targets will be
exceeded? How much will the blend cost? (Let A = type A seed ; B = type B seed)
What is the objective function of the given problem?
: Min A + 2B
9. Which of the following CANNOT be a constraint of the given problem?
: 1A + 1B <= 300
10. From the given graph, which area (I, II, III, or IV) forms the feasible region?
:I
11. August assembles stereo equipment for resale in his shop. He offers two products,
turntables and cassette players. He makes a profit of P100 on each turntable and
P60 on each cassette. Both must go through two steps in his shop - assembly and
bench checking. A turntable takes 12 hours to assemble and 4 hours to bench
check. A cassette player takes 4 hours to assemble but 8 hours to bench check.
 Looking at this month's schedule, August sees that he has 60 assembly hours
uncommitted and 40 hours of bench-checking time available.
What is the objective function of the given problem?
: Max 100T + 60C
12. Which of the following cannot be a constraint of the above problem?
: C <= 0
13. From the given graph, which area (I, II, III, or IV) forms the feasible region?
: III
14. Which of the following point is optimal?
: (4, 3)
15. How many turntables and cassette players must August assemble?
: 4 turntables; 3 casette plauers
16. All linear programming problems have all fo the following properties EXCEPT
: variables that are all restricted to nonnegative values
17. Which of the following statements is NOT true?
: An infeasible solution violates all cosntraints
18. To find the optimal solution to a linear programming problem using the graphical
method
: None of the alternatives is correct
19. Transportation, assignment, and transhipment problems have wide applications and
belong to a class of linear programming problems called ---?
: network flow problems
20. Which of the following is TRUE about the difference between the transportation and
assignment problems?
: Each supply and demand value is 1 in the assignemnt problem
21. A professor has been contacted by four not for profit agencies that are willing to
work with students consulting teams. The agencies need help with such things as
budgeting, information systems, coordinating volunteers, and forecasting. Although
each of the four student teams could work with any agencies, the professor feels
that there is a difference in the amount of time it would take each group to solve
each problem. The professor's estimate of the time, in days, is given in the table
below.
: (d) Min: 32x A1 + 35x A2 + 15x A3...
22. Which of the following constraints is not part for this network problem?
: (c) x b1 + x b2 + x b3 + x b4 = 1
23. How many constraints does this network problem has, excluding the hidden
constraints that all x 4 >= 0?
: 16
24. The minimum value of z = 3x + 5y subjected to constraints x + 3y >= 3, x + y >= 2, x
>= 0, y >= 0 is:
:7
25. For the LP problem. Minimize z = 2x + 3y the coordinated of the corner points of the
bounded feasible region are A (3,3), B(20, 3), C(20,10), D(18, 12), and E(12,12). The
minimum value of z is:
: 15