Theoretical Practice Sheet No.

1
Linear Programming Applications and Graphical Solution

Choose the correct answer from the following statements:

1. Using linear programming to maximize audience exposure in an advertising campaign

is an example of the type of linear programming application known as:
a) marketing research
b) media selection
c) portfolio assessment
d) media budgeting
e) all of the above

2. The following does not represent a factor a manager might consider when employing
linear programming for a production scheduling
a) labor capacity
b) space limitations
c) product demand
d) risk assessment
e) inventory cost

3. When formulating transportation LP problems, constraints usually deal with

a) the number of items to be transported
b) the shipping cost associated with transporting goods
c) the distance goods are to be transported
d) the number of origins and destinations
e) the capacities of origins and requirements of destinations

4. Work scheduling is a type of LP problem that

a) is used to address staffing needs over a specific time period.
b) b. is useful when there is flexibility in assigning workers to jobs requiring
interchangeable talents
c) is frequently used by large banks
d) might be used to determine the teller assignments in banks
e) all of the above

5. When applying linear programming to diet problems, the objective function is usually
designed to
a) maximize profits from blends of nutrients
b) maximize ingredient blends
c) minimize production losses
d) maximize the number of products to be produced
e) minimize the costs of nutrient blends

1
6. The diet problem in
a) also called the feed mix problem in agriculture
b) a special case of ingredient mix problem
c) a special case of blending problem
d) all of the above

7. The following problem type is such a special case of LP that a special algorithm has
been developed to solve it
a) the transportation problem
b) the diet problem
c) the ingredient mix problem
d) the production mix problem
e) none of the above

8. Determining the most efficient allocation of people, machines, equipment, etc., is

characteristics of the LP problem type known as
a) production scheduling
b) labor planning
c) assignment
d) blending
e) none of the above

9. The selection of specific investments from among a wide variety of alternatives is the
type of LP problem known as
a) the product mix problem
b) the investment banker problem
c) the portfolio selection problem
d) the Wall Street problem
e) none of the above

10. When using a graphical solution procedure, the region bounded by the set of
constraints is called the
a) solution
b) feasible region
c) infeasible region
d) maximum profit region
e) none of the above

11. The graphical method of linear programming can only handle _____ decision
variables
a) one
b) two
c) three
d) none of the above

2
12. The graphical method of LP uses
a) objective equations
b) constraint equations
c) linear equations
d) all of the above
e) none of the above

13. A feasible solution to a linear programming problem

a) must satisfy all of the problem’s constraints simultaneously
b) need not satisfy all of the constraints, only some of them
c) must be a corner point of the feasible region
d) must give the maximum profit possible

3
State whether the following statements are true or false and correct the false
statements:

1. Any linear programming problem can be solved using the graphical solution
procedure

2. The set of solution points that satisfies all of a linear programming problem’s
constraints simultaneously is defined as the feasible region in graphical linear
programming.

3. An objective function is necessary in a maximization problem but is not required

in a minimization problem.

4. In the term linear programming, the world programming comes from the phrase
“computer programming”.

5. Constructing a model is a translation from verbal, qualitative terms to logical,

quantitative terms.

6. In linear programming the objective function can take any form, the only
condition is that it must be in terms of the decision variables.

7. In linear programming, the function to be maximized or minimized is called

structural constraints.

8. Cross terms such as x1 x2 are allowed in linear programming problem.

9. In blending problem, the decision variables are the quantity to be produced from
each product

10. If one of the constraints is equal, then the feasible area can be a triangle.

11. 26. Graphical methods can be used to solve linear programming models of two or
more decision variables.

12. The direction of all “less than or equal” constraints is always to the left of the
constraints.

13. In the work scheduling problem, the decision variables are the number of
employees that start work at the middle of each shift.

14. Linear Programming can be used to select effective media mixes, to allocate fixed
of limited budgets across media, and to maximize audience exposure

15. Blending problems arise when one must decide which of two or more ingredients
is to be chosen to produce a product