Question 51) A quadratic programming problem involves which of the following conditions? A) squared terms in the objective function and linear constraints

51) A quadratic programming problem involves which of the following conditions?

A) squared terms in the objective function and linear constraints

B) linear objective function and squared terms in the constraints

C) squared terms in both the objective function and constraints

D) a strictly goal programming problem with squared terms in the objective function

E) None of the above

52) Which of the following statements is false concerning goal programming?

A) The objective function is the main difference between linear programming and goal programming.

B) The objective in goal programming is to minimize deviational variables.

C) Deviational variables are zero if a goal is completely obtained.

D) It is not possible for two goals to have equal priority.

E) The priorities of each goal are reflected in the objective function.

53) Consider the following 0-1 integer programming problem:

If we wish to add the constraint that no more than two of these variables must be positive, how would this be written?

A) 2X + 2Y + 2Z ? 3

B) X + Y + Z ? 2

C) X ? 2, and Y ? 2, and Z ? 2

D) X, Y, Z ? 2

E) None of the above

54) Consider the following 0 – 1 integer programming problem:

If we wish to add the constraint that X must be positive, and that only Y or Z, but not both, can be positive, how would the additional constraint(s) be written?

A) X + Y + Z ? 3, Y + Z ? 1

B) X ? 1, Y + Z = 1

C) X ? 2, and Y ? 2, and Z ? 2

D) X = 1, Y + Z ? 1

E) None of the above

55) An integer programming (maximization) problem was first solved as a linear programming problem, and the objective function value (profit) was $253.67. The two decision variables (X, Y) in the problem had values of X = 12.45 and Y = 32.75. Which of the following must be true for the optimal integer solution to this problem?

A) X = 12 Y = 32

B) X = 12 Y = 33

C) X = 12

D) Y = 32

E) None of the above

56) The overall best solution in a nonlinear program is a

A) global optimum.

B) local optimum.

C) binary optimum.

D) nonlinear optimum.

E) goal optimum.

57) A goal programming problem had two goals (with no priorities assigned). Goal number 1 was to achieve a cost of $2,400 and goal number 2 was to have no idle time for workers in the factory. The optimal solution to this problem resulted in a cost of $2,400 and no idle time. What was the value for the objective function for this goal programming problem?

A) 2300

B) 100

C) -100

D) 0

E) None of the above

58) A goal programming problem had two goals (with no priorities assigned). Goal number 1 was to achieve a cost of $3,600 and goal number 2 was to have no wasted material. The optimal solution to this problem resulted in a cost of $3,900 and no wasted material. What was the value for the objective function for this goal programming problem?

A) 300

B) -300

C) 3300

D) 0

E) None of the above

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.