Question 1 Which of the following is a valid objective function for a linear pro

Question

Question 1

Which of the following is a valid objective function for a linear programming problem?

a. Min 4x + 3y + (2/3)z

b. Max 5x2 + 6y2

c. Max 5xy

d. Min (x1+x2)/3

Question 2

Which of the following statements is NOT true?

a. An optimal solution satisfies all constraints.

b. An infeasible solution violates all constraints.

c. A feasible solution satisfies all constraints.

d. A feasible solution point does not have to lie on the boundary of the feasible region.

Question 3

Decision variables

a. tell how much or how many of something to produce, invest, purchase, hire, ect.

b. represent the values of the contraints.

c. measure the objective function.

d. must exist for each constraints.

Question 4

To find the optimal solution to a linear programming problem using the graphical method

a. find the feasible point that is at the highest location.

b. find the feasible point that is closest to the origin.

c. find the feasible point that is the farthest away from the origin.

d. None of the alternatives is always correct.

Question 5

Infeasibility means that the number of solutions to the linear programming models that satisfies all constraints is

a. 0.

b. an infinite number.

c. 1.

d. at least 2.

Question 6

A constraint that does not affect the feasible region is a

a. redundant constraint.

b. standard constraint.

c. non-negativity constraint.

d. slack constraint.

Question 7

The improvement in the value of the objective function per unit increase in a right-hand side is the

a. dual price.

b. constraint coefficient.

c. sensitivity value.

d. slack value.

Question 8

All linear programming problems have all of the following properties EXCEPT

a. set of linear constraints.

b. alternative optimal solutions.

c. a linear objective function that is to be maximized or minimized.

d. variables that are all restricted to nonnegative values.

Explanation / Answer

1)Valid objective function Min 4x + 3y + (2/3)z

2)  An infeasible solution violates all constraints ( An infeasible solution violates one or many constraints)

3) Decision variables tell how much or how many of something to produce, invest, purchase, hire, ect.

4)To find the optimal solution to a linear programming problem using the graphical method

answer D (because it depends mainly on objective function, whether it is maximization or minimization type, for Max it should be far from origin. For minimization it should be nearer to origin)

Infeasibility means that the number of solutions to the linear programming models that satisfies all constraints is

a. 0.

A constraint that does not affect the feasible region is a

a. redundant constraint.

The improvement in the value of the objective function per unit increase in a right-hand side is the

a. dual price.

All linear programming problems have all of the following properties EXCEPT

b.alternative optimal solutions

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.