Potential problems with the cutting plane method include

CME -II Test 2

Quiz
•
Professional Development
•
University
•
Hard
Dr M S Sureshkumar
Used 3+ times
FREE Resource
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
Create a free account and access millions of resources
Similar Resources on Wayground
15 questions
Python Programming - Introduction

Quiz
•
University
10 questions
CNC Part Programming 1

Quiz
•
University
15 questions
FINAL QUIZ MOTOMAN GP12

Quiz
•
University
10 questions
EDF Task 2: Smart Goals

Quiz
•
University
14 questions
Mechatronics

Quiz
•
University
8 questions
Flutter Flight 101: Flutter Introduction

Quiz
•
6th Grade - University
7 questions
DJ Hall Day 1 Students' Symposia

Quiz
•
University
10 questions
P231 Sustainable Site Planning Process

Quiz
•
University - Professi...
Popular Resources on Wayground
25 questions
Equations of Circles

Quiz
•
10th - 11th Grade
30 questions
Week 5 Memory Builder 1 (Multiplication and Division Facts)

Quiz
•
9th Grade
33 questions
Unit 3 Summative - Summer School: Immune System

Quiz
•
10th Grade
10 questions
Writing and Identifying Ratios Practice

Quiz
•
5th - 6th Grade
36 questions
Prime and Composite Numbers

Quiz
•
5th Grade
14 questions
Exterior and Interior angles of Polygons

Quiz
•
8th Grade
37 questions
Camp Re-cap Week 1 (no regression)

Quiz
•
9th - 12th Grade
46 questions
Biology Semester 1 Review

Quiz
•
10th Grade