MAT 540 WEEK 7 QUIZ 3 LATEST

1 / 4

# MAT 540 WEEK 7 QUIZ 3 LATEST - PowerPoint PPT Presentation

\nVisit Below Link, To Download This Course:\n\nhttps://www.tutorialsservice.net/product/mat-540-week-7-quiz-3-latest/\n\nOr \nEmail us on\nSUPPORT@TUTORIALSSERVICE.NET\n\nMAT 540 Week 7 Quiz 3 Latest\nMAT540\nMAT 540 Week 7 Quiz 3 Latest\nQuestion 1\nThe following inequality represents a resource constraint for a maximization problem:\nX Y ? 20\nQuestion 2\nIn minimization LP problems the feasible region is always below the resource constraints.\nQuestion 3\nIn a linear programming problem, all model parameters are assumed to be known with certainty.\nQuestion 4\nIf the objective function is parallel to a constraint, the constraint is infeasible.\nQuestion 5\nGraphical solutions to linear programming problems have an infinite number of possible objective function lines.\nQuestion 6\nSurplus variables are only associated with minimization problems.\nQuestion 7\nA feasible solution violates at least one of the constraints.\n

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about 'MAT 540 WEEK 7 QUIZ 3 LATEST' - tutorialsservicesnet

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

MAT 540 WEEK 7 QUIZ 3 LATEST

https://www.tutorialsservice.net/product/mat-540-week-7-quiz-3-latest/

Or

Email us on

SUPPORT@TUTORIALSSERVICE.NET

MAT 540 Week 7 Quiz 3 Latest

MAT540

MAT 540 Week 7 Quiz 3 Latest

Question 1

The following inequality represents a resource constraint for a maximization problem:

X + Y ? 20

Question 2

In minimization LP problems the feasible region is always below the resource constraints.

Question 3

In a linear programming problem, all model parameters are assumed to be known with certainty.

Question 4

If the objective function is parallel to a constraint, the constraint is infeasible.

Question 5

Graphical solutions to linear programming problems have an infinite number of possible objective function

lines.

Question 6

Question 7

A feasible solution violates at least one of the constraints.

Question 8

Cully furniture buys 2 products for resale: big shelves (B) and medium shelves (M). Each big shelf costs

\$500 and requires 100 cubic feet of storage space, and each medium shelf costs \$300 and requires 90

cubic feet of storage space.

The company has \$75000 to invest in shelves this week, and the warehouse has 18000 cubic feet

available for storage. Profit for each big shelf is \$300 and for each medium shelf is \$150. What is the

maximum profit?

Question 9

The following is a graph of a linear programming problem.

The feasible solution space is shaded, and the optimal solution is at the point labeled Z*.

This linear programming problem is a:

Question 10

Which of the following statements is not true?

Question 11

Decision variables

Question 12

The production manager for the Coory soft drink company is considering the production of 2 kinds of soft

drinks: regular and diet. Two of her limited resources are production time (8 hours = 480 minutes per day)

and syrup (1 of her ingredients) limited to 675 gallons per day. To produce a regular case requires 2

minutes and 5 gallons of syrup, while a diet case needs 4 minutes and 3 gallons of syrup. Profits for

regular soft drink are \$3.00 per case and profits for diet soft drink are \$2.00 per case. For the production

combination of 135 cases of regular and 0 cases of diet soft drink, which resources will not be completely

used?

Question 13

The following is a graph of a linear programming problem. The feasible solution space is shaded, and the

optimal solution is at the point labeled Z*.

Which of the following constraints has a surplus greater than 0?

Question 14

The following is a graph of a linear programming problem. The feasible solution space is shaded, and the

optimal solution is at the point labeled Z*.

The equation for constraint DH is:

Question 15

Cully furniture buys 2 products for resale: big shelves (B) and medium shelves (M). Each big shelf costs

\$500 and requires 100 cubic feet of storage space, and each medium shelf costs \$300 and requires 90

cubic feet of storage space. The company has \$75000 to invest in shelves this week, and the warehouse

has 18000 cubic feet available for storage. Profit for each big shelf is \$300 and for each medium shelf is

\$150. What is the storage space constraint?

Question 16

The production manager for the Coory soft drink company is considering the production of 2 kinds of soft

drinks: regular (R) and diet(D). Two of the limited resources are production time (8 hours = 480 minutes

per day) and syrup limited to 675 gallons per day. To produce a regular case requires 2 minutes and 5

gallons of syrup, while a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink

are \$3.00 per case and profits for diet soft drink are \$2.00 per case. What is the time constraint?

Question 17

A graphical representation of a linear program is shown below. The shaded area represents the feasible

region, and the dashed line in the middle is the slope of the objective function.

If this is a maximization, which extreme point is the optimal solution?

Question 18

Max Z = \$3x + \$9y

Subject to: 20x + 32y ? 1600

4x + 2y ? 240

y ? 40

x, y ? 0

At the optimal solution, what is the amount of slack associated with the second constraint?

Question 19

Consider the following minimization problem:

Min z = x1 + 2×2

s.t. x1 + x2 ? 300

2×1 + x2 ? 400

2×1 + 5×2 ? 750

x1, x2 ? 0

Find the optimal solution. What is the value of the objective function at the optimal solution? Note: The

25.0 (twenty five) would be written 25

Question 20

A graphical representation of a linear program is shown below. The shaded area represents the feasible

region, and the dashed line in the middle is the slope of the objective function.

What would be the new slope of the objective function if multiple optimal solutions occurred along line