MGMT 2255 Test 3 (Linear Programming Models: Graphical and Computer Models)

What is not a part of every linear programming problem formulation?

A redundant constraint

The simultaneous equation method is

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

Which of the following constraints are binding? Extrusion only Packing only Additive only Extrusion and Packaging All constraints are binding

Extrusion and Packaging

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

FALSE

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

FALSE

In a linear program, the constraints must be linear, but the objective function may be nonlinear.

FALSE

In some instances, an infeasible solution may be the optimum found by the corner point method.

FALSE

The term slack is associated with >= constraints

FALSE

There are no limitations on the number of constraints or variables that can be graphed to solve an LP problem.

FALSE

What is not considered a step in formulating a linear program?

Graph the constraints to determine the feasible region.

A widely use mathematical programming technique designed to help managers and decision making relative to resource allocation is called

Linear Programming

The corner point solution method

Requires that the profit from all corners of the feasible region be compared.

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

TRUE

Resource restrictions are called constraints.

TRUE

Sensitivity analysis enables us to look at the effects of changing the coefficients in the objective function, one at a time.

TRUE

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.

TRUE

The solution to a linear programming problem must always lie on a constraint.

TRUE

The term surplus is associated with >= constraints

TRUE

What is not a property of all linear programming problems?

a computer program

A constraint with zero slack or surplus is called a

binding constraint

Sensitivity analysis are used to examine the effects of changes in

contribution rates for each variables, technological coefficients, and available resources.

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

When appropriate, the optimal solution to a maximization linear programming problem can be found by graphing the feasible region and

finding the profit at every corner point of the feasibly region to see which one gives the highest value.

Typical resources of an organization include

machinery usage, labor volume, warehouse space utilization, raw material usage.

A feasible solution to a linear programming problem

must satisfy all of the problem's constraints simultaneously.

A constraint with positive slack or surplus is called a

nonbinding constraint

Sensitivity analysis may also be called

postoptimality analysis, parametric programming, and optimality analysis.

What type of problems use LP to decide how much of each product to make, given a series of resource restrictions?

product mix

The difference between the LHS and RHS of a less-than or equal-to constraint is referred to as

slack

The difference between the LHS and RHS of a greater-than or equal-to constraint is referred to as

surplus

The coefficients of the variables in the constraint equations that represent the amount of resources needed to produce one unit of the variable are called

technological coefficients