Question 51) Which of the following is a basic assumption of linear programming?

51) Which of the following is a basic assumption of linear programming?

A) The condition of uncertainty exists.

B) Independence exists for the activities.

C) Proportionality exists in the objective function and constraints.

D) Divisibility does not exist, allowing only integer solutions.

E) Solutions or variables may take values from -? to +?.

52) The condition when there is no solution that satisfies all the constraints simultaneously is called

A) boundedness.

B) redundancy.

C) optimality.

D) dependency.

E) None of the above

53) If the addition of a constraint to a linear programming problem does not change the solution, the constraint is said to be

A) unbounded.

B) non-negative.

C) infeasible.

D) redundant.

E) bounded.

54) Which of the following is not an assumption of LP?

A) simultaneity

B) certainty

C) proportionality

D) divisibility

E) additivity

55) The difference between the left-hand side and right-hand side of a less-than-or-equal-to constraint is referred to as

A) surplus.

B) constraint.

C) slack.

D) shadow price.

E) None of the above

56) The difference between the left-hand side and right-hand side of a greater-than-or-equal-to constraint is referred to as

A) surplus.

B) constraint.

C) slack.

D) shadow price.

E) None of the above

57) A constraint with zero slack or surplus is called a

A) nonbinding constraint.

B) resource constraint.

C) binding constraint.

D) nonlinear constraint.

E) linear constraint.

58) 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

A) technological coefficients.

B) objective coefficients.

C) shadow prices.

D) dual prices.

E) None of the above

59) A constraint with positive slack or surplus is called a

A) nonbinding constraint.

B) resource constraint.

C) binding constraint.

D) nonlinear constraint.

E) linear constraint.

60) A straight line representing all non-negative combinations of X1 and X2 for a particular profit level is called a(n)

A) constraint line.

B) objective line.

C) sensitivity line.

D) profit line.

E) isoprofit line.

61) In order for a linear programming problem to have a unique solution, the solution must exist

A) at the intersection of the non-negativity constraints.

B) at the intersection of a non-negativity constraint and a resource constraint.

C) at the intersection of the objective function and a constraint.

D) at the intersection of two or more constraints.

E) None of the above

62) In order for a linear programming problem to have multiple solutions, the solution must exist

A) at the intersection of the non-negativity constraints.

B) on a non-redundant constraint parallel to the objective function.

C) at the intersection of the objective function and a constraint.

D) at the intersection of three or more constraints.

E) None of the above

63) Consider the following linear programming problem:

The maximum possible value for the objective function is

A) 360.

B) 480.

C) 1520.

D) 1560.

E) None of the above

64) Consider the following linear programming problem:

Which of the following points (X,Y) is feasible?

Our website has a team of professional writers who can help you write any of your homework. They will write your papers from scratch. We also have a team of editors just to make sure all papers are of HIGH QUALITY & PLAGIARISM FREE. To make an Order you only need to click Ask A Question and we will direct you to our Order Page at WriteDemy. Then fill Our Order Form with all your assignment instructions. Select your deadline and pay for your paper. You will get it few hours before your set deadline.