CME -II Test 2

CME -II Test 2

Assessment

Quiz

Created by

Dr M S Sureshkumar

Professional Development

University

3 plays

Hard

Student preview

quiz-placeholder

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Potential problems with the cutting plane method include

It may never converge to a solution.

It can be used only for problems with two dimensions.

It may not take a great deal of computer time to find a solution.

It does not produce a good integer solution until the final solution is reached.

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Mark the wrong statement:

Goal programming assumes that the decision-maker has a linear utility function with respect to the objectives.

Deviations for various goals may be given penalty weights in accordance with the relative significance of the objectives.

The penalty weights measure the marginal rate of substitution between the objectives.

A goal programming problem cannot have multiple optimal solutions.

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The first step in a branch and bound approach to solving integer programming problems is to

Graph the problem

Change the objective function coefficients to whole integer numbers.

Solve the original problem using LP by allowing continuous noninteger solutions.

Compare the lower bound to any upper bound of your choice.

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

When using the branch and bound method in integer programming maximization problem, the stopping rule for branching is to continue until

The objective function is zero.

The new upper bound exceeds the lower bound.

The new upper bound is less than or equal to the lower bound or no further branching is possible.

The lower bound reaches zero.

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is not a type of integer programming problem?

Pure integer programming problem

Blending problem

Zero-one programming problem

Mixed-integer programming problem

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Consider the following problem:Max. Z = 28x1 + 32x2, subject to 5x1 + 3x2 ≤ 23, 4x1 + 7x2 ≤ 33, and x1 ≥ 0, x2 ≥ 0. This problem is:

A pure IPP.

A 0-1 IPP.

A mixed IPP.

Not an IPP.

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The _______________ divides a set of feasible solutions into subsets that are examined systematically.

Cutting plane method

Simplex method

Branch and bound method

Mixed-integer method

Explore all questions with a free account

or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?