Question 1

The rationality assumption implies that solutions need not be in whole numbers (integers).

Accepted Answer

A) True 
 B)False

Question 2

There are no limitations on the number of constraints or variables that can be graphed to solve an LP problem.

Accepted Answer

A) True 
 B)False

Question 3

The shadow price is the same as the dual price in maximization problems.

Accepted Answer

A) True 
 B)False

Question 4

In some instances,an infeasible solution may be the optimum found by the corner point method.

Accepted Answer

A) True 
 B)False

Question 5

Suppose a linear programming (minimization)problem has been solved and the optimal value of the objective function is $300.Suppose an additional constraint is added to this problem.Explain how this might affect each of the following:
(a)the feasible region,
(b)the optimal value of the objective function.

Accepted Answer

(a)Adding a new constraint will reduce t

Question 6

Define alternate optimal solutions with respect to an LP solution.

Accepted Answer

More than one optimal solution

Question 7

Any linear programming problem can be solved using the graphical solution procedure.

Accepted Answer

A) True 
 B)False

Question 8

Typical resources of an organization include

Accepted Answer

A) machinery usage. 
B) labor volume. 
C) warehouse space utilization. 
D) raw material usage. 
E) All of the above 
A) machinery usage. 
B) labor volume. 
C) warehouse space utilization. 
D) raw material usage. 
E) All of the above

Question 9

The set of solution points that satisfies all of a linear programming problem's constraints simultaneously is defined as the feasible region in graphical linear programming.

Accepted Answer

A) True 
 B)False

Question 10

Which of the following is a basic assumption of linear programming?

Accepted Answer

A) The condition of uncertainty exists. 
B) Independence exists for the activities. 
C) Proportionality exists in the objective function and constraints. 
D) Divisibility does not exist,allowing only integer solutions. 
E) Solutions or variables may take values from -∞ to +∞. 
A) The condition of uncertainty exists. 
B) Independence exists for the activities. 
C) Proportionality exists in the objective function and constraints. 
D) Divisibility does not exist,allowing only integer solutions. 
E) Solutions or variables may take values from -∞ to +∞.

The rationality assumption implies that solutions need not be in whole numbers (integers).

There are no limitations on the number of constraints or variables that can be graphed to solve an LP problem.

The shadow price is the same as the dual price in maximization problems.

In some instances,an infeasible solution may be the optimum found by the corner point method.

Define alternate optimal solutions with respect to an LP solution.

Any linear programming problem can be solved using the graphical solution procedure.

Typical resources of an organization include

The set of solution points that satisfies all of a linear programming problem's constraints simultaneously is defined as the feasible region in graphical linear programming.

Which of the following is a basic assumption of linear programming?

Introduction to Quantitative Analysis

Probability Concepts and Applications

Decision Analysis

Regression Models

Forecasting

Inventory Control Models

Linear Programming Applications

Transportation,assignment,and Network Models

Integer Programming,goal Programming,and Nonlinear Programming

Project Management

Waiting Lines and Queuing Theory Models

Simulation Modeling

Markov Analysis

Statistical Quality Control

Analytic Hierarchy Process

Dynamic Programming

Decision Theory and the Normal Distribution

Game Theory

Mathematical Tools: Determinants and Matrices

Calculus-Based Optimization

Linear Programming: The Simplex Method

Transportation, Assignment, and Network Algorithms

Filters

Exam 7: Linear Programming Models: Graphical and Computer Methods

The rationality assumption implies that solutions need not be in whole numbers (integers).

There are no limitations on the number of constraints or variables that can be graphed to solve an LP problem.

The shadow price is the same as the dual price in maximization problems.

In some instances,an infeasible solution may be the optimum found by the corner point method.

Define alternate optimal solutions with respect to an LP solution.

Any linear programming problem can be solved using the graphical solution procedure.

Typical resources of an organization include

The set of solution points that satisfies all of a linear programming problem's constraints simultaneously is defined as the feasible region in graphical linear programming.

Which of the following is a basic assumption of linear programming?

Introduction to Quantitative Analysis

Probability Concepts and Applications

Decision Analysis

Regression Models

Forecasting

Inventory Control Models

Linear Programming Applications

Transportation,assignment,and Network Models

Integer Programming,goal Programming,and Nonlinear Programming

Project Management

Waiting Lines and Queuing Theory Models

Simulation Modeling

Markov Analysis

Statistical Quality Control

Analytic Hierarchy Process

Dynamic Programming

Decision Theory and the Normal Distribution

Game Theory

Mathematical Tools: Determinants and Matrices

Calculus-Based Optimization

Linear Programming: The Simplex Method

Transportation, Assignment, and Network Algorithms

Filters