Exam 2 Sec 1

Question 1

resource constraint

Answer 1

A functional constraint with a ≤ sign.

Question 2

benefit constraint

Answer 2

A functional constraint with a ≥ sign

Question 3

fixed-requirement constraint

Answer 3

A functional constraint with an = sign.

Question 4

resource-allocation problem

Answer 4

concerned with allocating resources to activities. Its constraint is a resource constraint.

Question 5

cost-benefit-trade-off problem

Answer 5

the trade-off between the total cost of the activities and the benefits to be achieved by these activities. Its constraint is a benefit constraint.

Question 6

mixed problem

Answer 6

Any linear programming problem that includes at least two of the three types of functional constraints (resource, benefit, and fixed-requirement)

Question 7

transportation problem

Answer 7

Involves finding a shipping plan that minimizes the total cost of transporting a product from a number of plants to a number of customers. Constraint is a fixed-requirement constraint

Question 8

assignment problem

Answer 8

Involves assigning people to tasks so as to minimize the total cost of performing these tasks. Constraint is a fixed-requirement constraint

Question 9

min cost problem

Answer 9

at least one supply and demand node.
A feasible solution will exist if total supply matches total demand.
The number of supply nodes can be different from the number of demand nodes.

Question 10

max cost problem

Answer 10

the total shipping capacity of its supply network, which links a single manufacturing plant to a single customer

Question 11

IE+30

Answer 11

infinity

Question 12

Allowable range

Answer 12

Your Objective coefficient minus the Allowable decrease and then the Objective coefficient plus the Allowable increase

Question 13

Optimal solution

Answer 13

how much you’re producing at each one (yellow cell)

Question 14

100% rule

Answer 14

if the sum of the percentage changes does not exceed 100% the original optimal solution definitely will still be optimal

Question 15

node

Answer 15

A junction point of a network, shown as a labeled circle.

Question 16

supply node

Answer 16

A node where the net amount of flow generated (outflow minus inflow) is a fixed positive number.

Question 17

demand node

Answer 17

A node where the net amount of flow generated (outflow minus inflow) is a fixed negative number, so that flow is absorbed there.

Question 18

arc

Answer 18

A channel through which flow may occur from one node to another, shown as an arrow between the nodes pointing in the direction in which flow is allowed.

Question 19

Transshipment problems

Answer 19

the shipments from the sources (supply nodes) to the destinations (demand nodes) might also pass through intermediate transfer points (transshipment nodes) such as distribution centers.

Question 20

transshipment node

Answer 20

A node where the amount of flow out equals the amount of flow in.

Question 21

5 types of network optimization problems

Answer 21

Assignment, Transportation, Transshipment, max/min flow, shortest path

Question 22

Area graph

Answer 22

displays total frequency, group frequency, and time series data?

Question 23

Pie

Answer 23

shows the relationship of parts to the whole

Question 24

Oral reports can be delivered in several ways:

Answer 24

(1) in a physical venue, (2) via a web-based delivery platform or intranet, or (3) in combination.

Question 25

data visualization

Answer 25

the process of developing a research report’s textual, tabular, graphical, and video/audio support materials

Question 26

support materials

Answer 26

data visualizations, their interpretations, as well as the stories, audio or video clips, and demonstrations that showcase and validate a research study’s insights and recommendations.

Question 27

The requirements of having a good title

Answer 27

concise but at the same time you want to make sure that it clearly identifies the topic of the report

Question 28

Shortest path assumption 1

Answer 28

You need to choose a path through the network that starts at the origin and ends at the destination.

Question 29

Shortest path assumption 2

Answer 29

The lines connecting certain pairs of nodes commonly are links (which allow travel in either direction), although arcs (which only permit travel in one direction) are also allowed.

Question 30

Shortest path assumption 3

Answer 30

Associated with each link (or arc) is a nonnegative number called its length.

Question 31

Shortest path assumption 4

Answer 31

The objective is to find the shortest path from the origin to the destination.

Question 32

what if analysis

Answer 32

The process of determining the effect of changing objective function coefficients, right-hand side values of constraints, and decision variable values on a linear program