Potential problems with the cutting plane method include

CME -II Test 2

Quiz
•
Dr M S Sureshkumar
•
Professional Development
•
University
•
3 plays
•
Hard
Student preview

10 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
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
Similar Resources on Quizizz
10 questions
COOOOOOOOODING

Quiz
•
University
12 questions
Chapter 5: Using Morphemes to Learn Vocabulary

Quiz
•
University
15 questions
DAY 7 Pointer Structure & Union - 18th June 2024

Quiz
•
University
15 questions
Python Programming - Introduction

Quiz
•
University
12 questions
CONTABILIZACION DEL PROYECTO 2

Quiz
•
University
15 questions
C Operators

Quiz
•
University - Professi...
10 questions
CNC Part Programming 1

Quiz
•
University
10 questions
Creativity

Quiz
•
University
Popular Resources on Quizizz
19 questions
Naming Polygons

Quiz
•
3rd Grade
14 questions
Prime Factorization

Quiz
•
6th Grade
20 questions
math review

Quiz
•
4th Grade
21 questions
6th Grade Math CAASPP Practice

Quiz
•
6th Grade
20 questions
Reading Comprehension

Quiz
•
5th Grade
20 questions
Types of Credit

Quiz
•
9th - 12th Grade
35 questions
4th Grade Math SOL Review

Quiz
•
4th Grade
20 questions
Taxes

Quiz
•
9th - 12th Grade
Discover more resources for Professional Development
15 questions
Disney Trivia

Quiz
•
University
20 questions
Disney Trivia

Quiz
•
University
52 questions
Logos Trivia

Quiz
•
KG - University
23 questions
History of English and Review

Quiz
•
KG - University
12 questions
Scientific Notation

Quiz
•
University
5 questions
Tone and Mood in Literature

Interactive video
•
4th Grade - University
7 questions
Food Webs and Energy Pyramids: Bedrocks of Biodiversity

Interactive video
•
11th Grade - University
8 questions
G2U6W1 - The Golden Flower: A Taino Myth from Puerto Rico

Quiz
•
2nd Grade - University