Question 1

The difference between the transportation and assignment problems is that

Accepted Answer

A) total supply must equal total demand in the transportation problem 
B) the number of origins must equal the number of destinations in the transportation problem 
C) each supply and demand value is 1 in the assignment problem 
D) there are many differences between the transportation and assignment problems 
A) total supply must equal total demand in the transportation problem 
B) the number of origins must equal the number of destinations in the transportation problem 
C) each supply and demand value is 1 in the assignment problem 
D) there are many differences between the transportation and assignment problems

Question 2

Optimal assignments are made in the Hungarian method to cells in the reduced matrix that contain a 0.

Accepted Answer

A) True 
 B)False

Question 3

In assignment problems, dummy agents or tasks are created when the number of agents and tasks is not equal.

Accepted Answer

A) True 
 B)False

The difference between the transportation and assignment problems is that

Optimal assignments are made in the Hungarian method to cells in the reduced matrix that contain a 0.

In assignment problems, dummy agents or tasks are created when the number of agents and tasks is not equal.

Introduction

Introduction to Linear Programming

LP Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications

Advanced Linear Programming Applications

Distribution and Network Problems

Integer Linear Programming

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Forecasting

Markov Processes

LP: Simplex Method

Simplex-Based Sensitivity Analysis and Duality

Minimal Spanning Tree

Dynamic Programming

Filters

Exam 19: Solution Procedures for Transportation and Assignment Problems

The difference between the transportation and assignment problems is that

Optimal assignments are made in the Hungarian method to cells in the reduced matrix that contain a 0.

In assignment problems, dummy agents or tasks are created when the number of agents and tasks is not equal.

Introduction

Introduction to Linear Programming

LP Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications

Advanced Linear Programming Applications

Distribution and Network Problems

Integer Linear Programming

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Forecasting

Markov Processes

LP: Simplex Method

Simplex-Based Sensitivity Analysis and Duality

Minimal Spanning Tree

Dynamic Programming

Filters