Question 1

Which of the following special cases does NOT require reformulation of the problem in order to obtain a solution?

Accepted Answer

A) alternative optimality 
B) infeasibility 
C) unboundedness 
D) Each case requires a reformulation. 
A) alternative optimality 
B) infeasibility 
C) unboundedness 
D) Each case requires a reformulation. A

Question 2

For the following linear programming problem,determine the optimal solution using the graphical solution method.Are any of the constraints redundant? If yes,identify the constraint that is redundant.

Accepted Answer

X = 2 and Y = 1 Yes,there is a redundant constraint; Y ≤ 1 ​

Question 3

A linear programming problem can be both unbounded and infeasible.

Accepted Answer

A) True 
 B)False  False

Question 4

All linear programming problems have all of the following properties EXCEPT

Accepted Answer

A) a linear objective function that is to be maximized or minimized. 
B) a set of linear constraints. 
C) alternative optimal solutions. 
D) variables that are all restricted to nonnegative values. 
A) a linear objective function that is to be maximized or minimized. 
B) a set of linear constraints. 
C) alternative optimal solutions. 
D) variables that are all restricted to nonnegative values.

Question 5

When no solution to the linear programming problem satisfies all the constraints,including the nonnegativity conditions,it is considered

Accepted Answer

A) optimal. 
B) feasible. 
C) infeasible. 
D) semifeasible. 
A) optimal. 
B) feasible. 
C) infeasible. 
D) semifeasible.

Question 6

A variable added to the left-hand side of a less-than-or-equal-to constraint to convert the constraint into an equality is a

Accepted Answer

A) standard variable. 
B) slack variable. 
C) surplus variable. 
D) nonnegative variable. 
A) standard variable. 
B) slack variable. 
C) surplus variable. 
D) nonnegative variable.

Question 7

In a linear programming problem,the objective function and the constraints must be linear functions of the decision variables.

Accepted Answer

A) True 
 B)False

Question 8

The three assumptions necessary for a linear programming model to be appropriate include all of the following EXCEPT

Accepted Answer

A) proportionality. 
B) additivity. 
C) divisibility. 
D) normality. 
A) proportionality. 
B) additivity. 
C) divisibility. 
D) normality.

Question 9

Solve the following system of simultaneous equations.6X + 4Y = 40
2X + 3Y = 20

Accepted Answer

The answer of Solve the following system of simultaneous equations.6X...

Question 10

Does the following linear programming problem exhibit infeasibility,unboundedness,or alternative optimal solutions? Explain.

Accepted Answer

The proble

Question 11

Muir Manufacturing produces two popular grades of commercial carpeting among its many other products.In the coming production period,Muir needs to decide how many rolls of each grade should be produced in order to maximize profit.Each roll of Grade X carpet uses 50 units of synthetic fiber,requires 25 hours of production time,and needs 20 units of foam backing.Each roll of Grade Y carpet uses 40 units of synthetic fiber,requires 28 hours of production time,and needs 15 units of foam backing.​
The profit per roll of Grade X carpet is $200,and the profit per roll of Grade Y carpet is $160.In the coming production period,Muir has 3000 units of synthetic fiber available for use.Workers have been scheduled to provide at least 1800 hours of production time (overtime is a possibility).The company has 1500 units of foam backing available for use.​
Develop and solve a linear programming model for this problem.

Accepted Answer

Let X = number of rolls of Gra

Question 12

The point (3,2)is feasible for the constraint 2x1 + 6x2 ≤ 30.

Accepted Answer

A) True 
 B)False

Question 13

For a minimization problem,the solution is considered to be unbounded if the value may be made infinitely small.

Accepted Answer

A) True 
 B)False

Question 14

A redundant constraint results in

Accepted Answer

A) no change in the optimal solution(s). 
B) an unbounded solution. 
C) no feasible solution. 
D) alternative optimal solutions. 
A) no change in the optimal solution(s). 
B) an unbounded solution. 
C) no feasible solution. 
D) alternative optimal solutions.

Question 15

Maxwell Manufacturing makes two models of felt-tip marking pens.Requirements for each lot of pens are given below.   ​
The profit for either model is $1000 per lot. 
a.What is the linear programming model for this problem?
b.Find the optimal solution.
c.Will there be excess capacity in any resource?
​

Accepted Answer

​ a. Let F = number of lots of Fliptop p

Question 16

Only binding constraints form the shape (boundaries)of the feasible region.

Accepted Answer

A) True 
 B)False

Question 17

Use this graph to answer the questions.     ​ 
a.Which area (I,II,III,IV,or V)forms the feasible region?
b.Which point (A,B,C,D,or E)is optimal?
c.Which constraints are binding?
d.Which slack variables equal zero?
​

Accepted Answer

a. Area III is the feasible re

Question 18

The constraint 2x1 − x2 = 0 passes through the point (200,100).

Accepted Answer

A) True 
 B)False

Question 19

Consider the following linear programming problem:   ​ 
a.Use a graph to show each constraint and the feasible region.
b.Identify the optimal solution point on your graph.What are the values of X and Y at the optimal solution?
c.What is the optimal value of the objective function?

Accepted Answer

a. @#IMG-DLM& @#IMG-DLM& b. The optimal solution o

Question 20

Constraints limit the degree to which the objective in a linear programming problem is satisfied.

Accepted Answer

A) True 
 B)False

Which of the following special cases does NOT require reformulation of the problem in order to obtain a solution?

For the following linear programming problem,determine the optimal solution using the graphical solution method.Are any of the constraints redundant? If yes,identify the constraint that is redundant.

A linear programming problem can be both unbounded and infeasible.

All linear programming problems have all of the following properties EXCEPT

When no solution to the linear programming problem satisfies all the constraints,including the nonnegativity conditions,it is considered

A variable added to the left-hand side of a less-than-or-equal-to constraint to convert the constraint into an equality is a

In a linear programming problem,the objective function and the constraints must be linear functions of the decision variables.

The three assumptions necessary for a linear programming model to be appropriate include all of the following EXCEPT

Solve the following system of simultaneous equations.6X + 4Y = 40 2X + 3Y = 20

Does the following linear programming problem exhibit infeasibility,unboundedness,or alternative optimal solutions? Explain.

The point (3,2)is feasible for the constraint 2x₁ + 6x₂ ≤ 30.

For a minimization problem,the solution is considered to be unbounded if the value may be made infinitely small.

A redundant constraint results in

Maxwell Manufacturing makes two models of felt-tip marking pens.Requirements for each lot of pens are given below. The profit for either model is $1000 per lot. a.What is the linear programming model for this problem? b.Find the optimal solution. c.Will there be excess capacity in any resource?

Only binding constraints form the shape (boundaries)of the feasible region.

Use this graph to answer the questions. a.Which area (I,II,III,IV,or V)forms the feasible region? b.Which point (A,B,C,D,or E)is optimal? c.Which constraints are binding? d.Which slack variables equal zero?

The constraint 2x₁ − x₂ = 0 passes through the point (200,100).

Consider the following linear programming problem: a.Use a graph to show each constraint and the feasible region. b.Identify the optimal solution point on your graph.What are the values of X and Y at the optimal solution? c.What is the optimal value of the objective function?

Constraints limit the degree to which the objective in a linear programming problem is satisfied.

Introduction

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

Linear Programming: Simplex Method

Simplex-Based Sensitivity Analysis and Duality

Solution Procedures for Transportation and Assignment Problems

Minimal Spanning Tree

Dynamic Programming

Filters

Exam 2: An Introduction to Linear Programming

Which of the following special cases does NOT require reformulation of the problem in order to obtain a solution?

For the following linear programming problem,determine the optimal solution using the graphical solution method.Are any of the constraints redundant? If yes,identify the constraint that is redundant.

A linear programming problem can be both unbounded and infeasible.

All linear programming problems have all of the following properties EXCEPT

When no solution to the linear programming problem satisfies all the constraints,including the nonnegativity conditions,it is considered

A variable added to the left-hand side of a less-than-or-equal-to constraint to convert the constraint into an equality is a

In a linear programming problem,the objective function and the constraints must be linear functions of the decision variables.

The three assumptions necessary for a linear programming model to be appropriate include all of the following EXCEPT

Solve the following system of simultaneous equations.6X + 4Y = 40 2X + 3Y = 20

Does the following linear programming problem exhibit infeasibility,unboundedness,or alternative optimal solutions? Explain.

The point (3,2)is feasible for the constraint 2x1 + 6x2 ≤ 30.

For a minimization problem,the solution is considered to be unbounded if the value may be made infinitely small.

A redundant constraint results in

Only binding constraints form the shape (boundaries)of the feasible region.

Use this graph to answer the questions. ​ a.Which area (I,II,III,IV,or V)forms the feasible region? b.Which point (A,B,C,D,or E)is optimal? c.Which constraints are binding? d.Which slack variables equal zero? ​

The constraint 2x1 − x2 = 0 passes through the point (200,100).

Consider the following linear programming problem: ​ a.Use a graph to show each constraint and the feasible region. b.Identify the optimal solution point on your graph.What are the values of X and Y at the optimal solution? c.What is the optimal value of the objective function?

Constraints limit the degree to which the objective in a linear programming problem is satisfied.

Introduction

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

Linear Programming: Simplex Method

Simplex-Based Sensitivity Analysis and Duality

Solution Procedures for Transportation and Assignment Problems

Minimal Spanning Tree

Dynamic Programming

Filters

The point (3,2)is feasible for the constraint 2x₁ + 6x₂ ≤ 30.

Use this graph to answer the questions. a.Which area (I,II,III,IV,or V)forms the feasible region? b.Which point (A,B,C,D,or E)is optimal? c.Which constraints are binding? d.Which slack variables equal zero?

The constraint 2x₁ − x₂ = 0 passes through the point (200,100).

Consider the following linear programming problem: a.Use a graph to show each constraint and the feasible region. b.Identify the optimal solution point on your graph.What are the values of X and Y at the optimal solution? c.What is the optimal value of the objective function?