Scribd
Upload
34 views

My Courses: Home UGRD-GE6114-2113T Week 6-7: Linear Programming & Problem Solving Strategies Midterm Quiz 1

The document is a quiz summary from an undergraduate course on linear programming and problem solving strategies. It provides the results of a 10 question multiple choice midterm quiz, including the questions asked and the correct answers selected by the student. All questions were answered correctly, with the student scoring 100% on the quiz.

Uploaded by

Miguel Angelo Garcia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
34 views

My Courses: Home UGRD-GE6114-2113T Week 6-7: Linear Programming & Problem Solving Strategies Midterm Quiz 1

The document is a quiz summary from an undergraduate course on linear programming and problem solving strategies. It provides the results of a 10 question multiple choice midterm quiz, including the questions asked and the correct answers selected by the student. All questions were answered correctly, with the student scoring 100% on the quiz.

Uploaded by

Miguel Angelo Garcia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Home / My courses / UGRD-GE6114-2113T / Week 6-7 : Linear Programming & Problem Solving Strategies / Midterm Quiz 1

State Finished

Time taken 1 min 28 secs

Grade 100.00 out of 100.00

Question 1 It refers to the maximal value for profit that always corresponds to a corner point on feasible region
Correct

Mark 1.00 out of Select one:


1.00
a. Northwest Corner Algorithm

b. Simplex Method

c. Feasible Region

d. Corner Point Principle

Question 2 It is a special table showing costs and rim conditions for transportation problems.
Correct

Mark 1.00 out of Select one:


1.00
a. Summation Table

b. Table of Specification

c. Tableau

d. Objective Function Table

Question 3 Who developed Linear Programming?


Correct

Mark 1.00 out of Select one:


1.00
a. Karl Marx

b. John Nash

c. Leonid Kantorovich

d. John Maynard Keynes


Question 4 It is a principle that gives an optimal number of each product to produce where: It is possible to produce this
Correct number of products & gives yields maximum profit.
Mark 1.00 out of
1.00 Select one:
a. Simplex Method

b. Tableaus

c. Optimal Production Policy

d. Northwest Corner Algorithm

Question 5 Which of the following statements shown below is NOT considered a property in Linear Programming?
Correct

Mark 1.00 out of Select one:


1.00
a. The relationship among decision variables must be linear

b. Constraints pertaining to resources are essential

c. Constraints must be negative

d. An objective function must always be present in a linear model. It states whether to maximize or minim

Question 6 Which of the following statements shown below is NOT essential in Linear Programming?
Correct

Mark 1.00 out of Select one:


1.00
a. Homogeneity

b. Limited Resources

c. Divisibility

d. Equality

Question 7 it was developed to help solve large, real world linear programming problems.
Correct

Mark 1.00 out of Select one:


1.00
a. Tableaus

b. Corner Point Principle

c. Simplex Method

d. Optimal Production Policy


Question 8 It is a mathematical tool for maximizing or minimizing a quantity, that's subjected to certain constraints.
Correct

Mark 1.00 out of Select one:


1.00
a. Linear Systems

b. Linearity Principle

c. Linear Algebra

d. Linear Programming

Question 9 What do you call the region which consists of all possible solution choices for a particular problem?
Correct

Mark 1.00 out of Select one:


1.00
a. Cartessian plane

b. Solution Set

c. Feasible Region

d. Inequality Region

Question 10 What method is used for computing a basic feasible solution to a transportation problem?
Correct

Mark 1.00 out of Select one:


1.00
a. Northwest Corner Rule

b. Tableaus

c. Corner Point Principle

d. Simplex Method

W8 & W9 - Data Managemen


◄ WEEK 7-LINEAR PROGRAMMING Jump to...
MODULE ►

You might also like