Question 1

In order to determine a basic solution,set n − m of the variables equal to zero,and solve the m linear constraint equations for the remaining m variables.

Accepted Answer

A) True 
 B)False

Question 2

The variable to enter into the basis is the variable with the largest positive cj − zj value.

Accepted Answer

A) True 
 B)False

Question 3

In a simplex tableau,a variable is associated with each column and both a constraint and a basic variable are associated with each row.

Accepted Answer

A) True 
 B)False

Question 4

A basic feasible solution also satisfies the nonnegativity restriction.

Accepted Answer

A) True 
 B)False

Question 5

A manager for a food company is putting together a buffet,and she is trying to determine the best mix of crab and steak to be served.Below are variable definitions she developed including vitamin,mineral,and protein requirements and an optimal simplex tableau she obtained from her computations.She is interested in interpreting what it means.​
Variable definitions:
xl = amount of crab (oz.)to be served per buffet batch
x2 = amount of steak (oz.)to be served per buffet batch
s1 = vitamin A units provided in excess of requirements
s2 = mineral units provided in excess of requirements
s3 = protein units provided in excess of requirements
Optimal tableau   ​

Accepted Answer

​ Optimal solution: 15 ounces of crab in

In order to determine a basic solution,set n − m of the variables equal to zero,and solve the m linear constraint equations for the remaining m variables.

The variable to enter into the basis is the variable with the largest positive c_j − z_j value.

In a simplex tableau,a variable is associated with each column and both a constraint and a basic variable are associated with each row.

A basic feasible solution also satisfies the nonnegativity restriction.

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, finance, and OM

Advanced Linear Programming Applications

Distribution and Network Models

Integer Linear Programming

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Time Series Analysis and Forecasting

Markov Processes

Simplex-Based Sensitivity Analysis and Duality

Solution Procedures for Transportation and Assignment Problems

Minimal Spanning Tree

Dynamic Programming

Filters

Exam 17: Linear Programming: Simplex Method

In order to determine a basic solution,set n − m of the variables equal to zero,and solve the m linear constraint equations for the remaining m variables.

The variable to enter into the basis is the variable with the largest positive cj − zj value.

In a simplex tableau,a variable is associated with each column and both a constraint and a basic variable are associated with each row.

A basic feasible solution also satisfies the nonnegativity restriction.

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, finance, and OM

Advanced Linear Programming Applications

Distribution and Network Models

Integer Linear Programming

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Time Series Analysis and Forecasting

Markov Processes

Simplex-Based Sensitivity Analysis and Duality

Solution Procedures for Transportation and Assignment Problems

Minimal Spanning Tree

Dynamic Programming

Filters

The variable to enter into the basis is the variable with the largest positive c_j − z_j value.