FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 19: Linear Programming

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 21

Multiple Choice

Review LaterAdd Note

Review Later

What is the objective function?

A) $0.30 B + $0.20 C = Z
B) $0.60 B + $0.30 C = Z
C) $0.20 B + $0.30 C = Z
D) $0.20 B + $0.40 C = Z
E) $0.10 B + $0.10 C = Z

F) C) and D)
G) B) and C)

Correct Answer

verified

Show Answer

Question 22

True/False

Review LaterAdd Note

Review Later

Linear programming techniques will always produce an optimal solution to an LP problem.

A) True
B) False

Correct Answer

verified

Show Answer

Question 23

Essay

Review LaterAdd Note

Given this problem:

What is the Dominican bean constraint?

Which of the following could not be a linear programming problem constraint?

Which of the choices below constitutes a simultaneous solution to these equations?

What is the time constraint?

Graphical linear programming can handle problems that involve any number of decision variables.

The logical approach, from beginning to end, for assembling a linear programming model begins with:

Consider the linear programming problem below: Determine the optimum amounts of x and y in terms of cost minimization.What is the minimum cost?

The term "range of optimality" refers to a constraint's right-hand side quantity.

The feasible solution space only contains points that satisfy all constraints.

The region which satisfies all of the constraints in graphical linear programming is called the:

The simplex method is a general-purpose LP algorithm that can be used for solving only problems with more than six variables.

The theoretical limit on the number of constraints that can be handled by the simplex method in a single problem is:

What is the constraint for resource III?

Which of the following is not a feasible production combination?

Non-binding constraints are not associated with the feasible solution space; i.e., they are redundant and can be eliminated from the matrix.

An example of a decision variable in an LP problem is profit maximization.

Wood Specialties Company produces wall shelves, bookends, and shadow boxes.It is necessary to plan the production schedule for next week.The wall shelves, bookends, and shadow boxes are made of oak, of which the company has 600 board feet.A wall shelf requires 4 board feet, bookends require 2 board feet, and a shadow box requires 3 board feet.The company has a power saw for cutting the oak boards into the appropriate pieces; a wall shelf requires 30 minutes, bookends require 15 minutes, and a shadow box requires 15 minutes.The power saw is expected to be available for 36 hours next week.After cutting, the pieces of work in process are hand finished in the finishing department, which consists of 4 skilled and experienced craftsmen, each of whom can complete any of the products.A wall shelf requires 60 minutes of finishing, bookends require 30 minutes, and a shadow box requires 90 minutes.The finishing department is expected to operate for 40 hours next week.Wall shelves sell for $29.95 and have a unit variable cost of $17.95; bookends sell for $11.95 and have a unit variable cost of $4.95; a shadow box sells for $16.95 and has a unit variable cost of $8.95. (A) Is this a problem in maximization or minimization? (B) What are the decision variables? Suggest symbols for them. (C) What is the objective function? (D) What are the constraints?