Exam 15: Transportation and assignment problems

Explore all topics

The requirements assumption states that each source has a fixed supply of units,where the entire supply must be distributed to the destinations and that each destination has a fixed demand for units,where the entire demand must be received from the sources

(True/False)

4.7/5

(45)

Question 41

A transportation problem requires a unit cost for every source-destination combination

(True/False)

4.8/5

(26)

Question 42

When formulating a transportation problem on a spreadsheet,which of the following are necessary?

(Multiple Choice)

4.8/5

(35)

Question 43

The Hungarian Method is an algorithm used to solve transportation problems

(True/False)

4.8/5

(31)

Question 44

In an assignment problem,every destination has a demand of 0 or 1

(True/False)

4.8/5

(25)

Question 45

An assignment problem:

(Multiple Choice)

4.9/5

(31)

Question 46

Which of the following problems can be reformulated to fit the format for a transportation problem?

(Multiple Choice)

4.9/5

(38)

Question 47

It is always necessary to add constraints to a transportation model in order to restrict variables to only integer values

(True/False)

4.9/5

(38)

Question 48

Showing 41 - 48 of 48

The requirements assumption states that each source has a fixed supply of units,where the entire supply must be distributed to the destinations and that each destination has a fixed demand for units,where the entire demand must be received from the sources

A transportation problem requires a unit cost for every source-destination combination

When formulating a transportation problem on a spreadsheet,which of the following are necessary?

The Hungarian Method is an algorithm used to solve transportation problems

In an assignment problem,every destination has a demand of 0 or 1

An assignment problem:

Which of the following problems can be reformulated to fit the format for a transportation problem?

It is always necessary to add constraints to a transportation model in order to restrict variables to only integer values

Introduction

Linear programming: Basic Concepts

Linear programming: Formulation and applications

Theart of modeling with spread sheets

What-If Analysis for linear programming

Network optimization problems

Using binary integer programming to deal withy es-Or-No decisions

Non linear programming

Decision Analysis

Forecasting

Queuing models

Computer simulation: Basic Concepts

Computer simulation with risks olver platform

Solution concepts for linear programming

Pert CPM models for project management

Goal programming

Inventory management with known demand

Inventory management with uncertain demand

Computer simulation with crystal ball

Filters