QA Midterm

What is the speediest solution method to use?

Isoprofit line

What is the product mix problem?

Two or more products are being produced using limited resources

Lines on the network that connect nodes are called _____

Arcs

When using a general LP model for transportation problems, if there are 4 sources and 3 destinations, which of the following statements is true? A) There are typically 4 decision variables and 3 constraints. B) There are typically 12 decision variables and 7 constraints. C) There are typically 7 decision variables and 7 constraints. D) There are typically 12 decision variables and 12 constraints

B) There are typically 12 decision variables and 7 constraints.

The mathematical theory behind linear programming states that an optimal solution to any problem will lie at a(n) ________ of the feasible region

Corner Point or Extreme Point

All the nodes must be connected in which of the following techniques? A) minimal-flow B) shortest-route C) maximal-flow D) minimal-spanning tree

D) minimal-spanning tree

Points on the network are referred to as _________

Nodes

In an LP problem, at least one corner point must be an optimal solution if an optimal solution exists: T or F

True

In production scheduling LP problems, inventory at the end of this month is set equal to A) inventory at the end of last month + this month's production - this month's sales. B) inventory at the beginning of last month + this month's production - this month's sales. C) inventory at the end of last month + last month's production - this month's sales. D) inventory at the beginning of last month + last month's production - last month's sales

A) inventory at the end of last month + this month's production - this month's sales.

Using linear programming to maximize audience exposure in an advertising campaign is an example of the type of linear programming application known as

A) media selection.

If items being transported must go through an intermediate point before reaching a final destination, then this situation is known as a(n) A) transshipment problem. B) assignment problem. C) transportation problem. D) intermediate point problem

A) transshipment problem.

Which of the following is considered a decision variable in the media selection problem of maximizing audience exposure? A) the amount spent on each ad type B) what types of ads to offer C) the number of ads of each type D) the overall advertising budget

C) the number of ads of each type

The two most common objectives for the assignment problem are the minimization of A) uncertainty or inexperience. B) total costs or inexperience. C) total costs or total time. D) total time or inexperience

C) total costs or total time.

the diet problem is

Classical optimization model for finding the least-costly set of foods that meets all dietary requirements.

Which of the following statements concerning the transshipment problem is false? A) There can be constraints on the number of units shipped out of an origin point. B) There can be constraints on the number of units shipped into a destination point. C) The transshipment problem can be solved with linear programming. D) Any units shipped from one origin point must all go to the same destination point

D) Any units shipped from one origin point must all go to the same destination point

What is said to exist when total demand equals total supply in a transportation problem? A) an equalized problem B) an equilibrialized problem C) a harmonized problem D) a balanced problem

D) a balanced problem

Which of the following is not a part of every linear programming problem formulation? A) an objective function B) a set of constraints C) non-negativity constraints D) a redundant constraint E) maximization or minimization of a linear function

D) a redundant constraint

When using the shortest-route technique, the first step is to A) connect the nearest node that minimizes the total distance to the origin. B) trace the path from the warehouse to the plant. C) determine the average distance traveled from source to end. D) find the nearest node to the origin and put a distance box by the node

D) find the nearest node to the origin and put a distance box by the node

Media selection problems are typically approached with LP by either A) maximizing audience exposure or maximizing number of ads per time period. B) maximizing the number of different media or minimizing advertising costs. C) minimizing the number of different media or minimizing advertising costs. D) maximizing audience exposure or minimizing advertising costs

D) maximizing audience exposure or minimizing advertising costs

A point in the network, that is at the beginning or end of a route is called a(n) A) arc. B) branch. C) line. D) node

D) node

The final node or destination in a network is called a(n) A) arc. B) branch. C) source. D) sink

D) sink

True or False Management resources that need control include machinery usage, labor volume, money spent, time used, warehouse space used, and material usage.

TRUE

The mathematical theory behind linear programming states that an optimal solution to any problem will lie at a(n) ________ of the feasible region.

corner point or extreme point

for the corner point solution method, an optimal solution must lie at one of the ________ or _________

corner points or extreme points

any point on or below the constraint plot will ________________

not violate the restriction

in solving a linear program, no feasible solution exists. To resolve this problem, we might

remove or relax a constraint

what does not represent a factor a manager might consider when employing LP for production scheduling?

risk assessment

When alternate optimal solutions exist in an LP problem, then

the objective function will be parallel to one of the constraints.

if a non redundant constraint is removed from an LP problem, then

the problem would become nonlinear

the selection of specific investments from among a wide variety of alternatives is the type of LP problem known as

the wall street problem

a graphical method should only be used to solve an LP problem when

there are only 2 variables

any point above the constraint plot will ________

violate the restriction

At the optimal solution point slack will be___________

zero

Linear programming

A widely used mathematical modeling technique designed to help managers in planning and decision making relative to resource allocation

properties of linear programming

-objective function -constraints -alternative courses of action are available -linear equations of inequalities

Consider the following linear programming problem: Maximize 12X + 10Y Subject to: 4X + 3Y ≤ 480 2X + 3Y ≤ 360 all variable ≥ 0 The maximum possible value for the objective function is

1520

the further we move from the origin the _____the profit

larger

When appropriate, the optimal solution to a maximization linear programming problem can be found by graphing the feasible region and A) Find the profit at every corner point of the feasible region to see which one gives the highest value. B) moving the isoprofit lines towards the origin in a parallel fashion until the last point in the feasible region is encountered. C) locating the point that is highest on the graph. D) sliding the constraints to find the greatest point of intersection.

A) finding the profit at every corner point of the feasible region to see which one gives the highest value

In a maximization problem, when one or more of the solution variables and the profit can be made infinitely large without violating any constraints, the linear program has A) an infeasible solution. B) an unbounded solution. C) a redundant constraint. D) alternate optimal solutions

B) an unbounded solution.

A technique that allows a researcher to determine the greatest amount of material that can move through a network is called A) maximal-flow. B) maximal-spanning. C) shortest-route. D) maximal-tree

B) maximal-spanning.

A feasible solution to a linear programming problem A) must be a corner point of the feasible region. B) must satisfy all of the problem's constraints simultaneously. C) need not satisfy all of the constraints, only the non-negativity constraints. D) must give the maximum possible profit

B) must satisfy all of the problem's constraints simultaneously.

The first step in the maximal-flow technique is to A) pick the node with the maximum flow. B) pick any path with some flow. C) eliminate any node that has a zero flow. D) add a dummy flow from the start to the finish.

B) pick any path with some flow.

Which of the following problems can be solved as a linear program using binary decision variables? A) maximal-flow problem B) shortest-route problem C) minimal-spanning tree problem D) product mix problem

B) shortest-route problem

The minimal-spanning technique would best be used A) to assign workers to jobs in the cheapest manner. B) to determine LAN network wiring within a building. C) to minimize traffic flow on a busy highway. D) by a trucking company making frequent but repeatable drops.

B) to determine LAN network wiring within a building.

The corner point solution method A) will always provide one, and only one, optimum. B) will yield different results from the isoprofit line solution method. C) requires that the profit from all corners of the feasible region be compared. D) requires that all corners created by all constraints be compare

C) requires that the profit from all corners of the feasible region be compared.

The origin or beginning node in a network is called A) home. B) delta. C) source. D) mouth. E) sink.

C) source.

Which of the following is considered a decision variable in the production mix problem of maximizing profit? A) the amount of raw material to purchase for production B) the number of product types to offer C) the selling price of each product D) the amount of each product to produce

D) the amount of each product to produce

Infeasibility in a linear programming problem occurs when A) a constraint is redundant. B) more than one solution is optimal. C) the feasible region is unbounded. D) there is no solution that satisfies all the constraints given.

D) there is no solution that satisfies all the constraints given.

in LP, variables do not have to be intger valued and may take on any fractional value, the assumption is called,

Divisibility

In a production scheduling problem, the inventory at the end of this month is set equal to the inventory at the end of last month + last month's production − sales this month: T or F

False

Objective function

The function being maximized or minimized in Linear Programming

Define slack

amount of a resource that is not used

The simultaneous equation method is

an algebraic means for solving the intersection of two or more constraint equations

which of the following would cause a change in the feasible region?

changing the right-hand side of a nonredundant constraint

Nodes are typically shaped like _________

circles

Using LP to maximize audience exposure in an advertising campaign is an example of the type of LP application known as

media selection

when applying LP to diet problems, the objective function is usually designed to

minimize the cost of nutrition blends

If the feasible region gets larger due to a change in one of the constraints, the optimal value of the objective function

must increase or remain the same for a maximization problem

a feasible solution to an LP problem

must satisfy all of the problem's constraints simultaneously.

in the optimal solution to a linear program, there are 20 units of slack for a constraint. From this we know that,

the dual price for this constraint is 0

When using a graphical solution procedure, the region bounded by the set of constraints is called _______

the feasible region

An LP problem has a bounded feasible region. If this problem has an equality (=) constraint, then

the feasible region must consist of a line segment

Optimal solution

the last point the objective function touches as it leaves the feasible solution area