Question 1

Which of the following statements is NOT true?

Accepted Answer

A) A feasible solution satisfies all constraints. 
B) An optimal solution satisfies all constraints. 
C) An infeasible solution violates all constraints. 
D) A feasible solution point does not have to lie on the boundary of the feasible region. 
A) A feasible solution satisfies all constraints. 
B) An optimal solution satisfies all constraints. 
C) An infeasible solution violates all constraints. 
D) A feasible solution point does not have to lie on the boundary of the feasible region.

Question 2

Does the following linear programming problem exhibit infeasibility,unboundedness,or alternate optimal solutions? Explain.
Min 3X + 3Y
s.t.1X + 2Y  0

Accepted Answer

The proble

Question 3

Whenever all the constraints in a linear program are expressed as equalities,the linear program is said to be written in

Accepted Answer

A) standard form. 
B) bounded form. 
C) feasible form. 
D) alternative form. 
A) standard form. 
B) bounded form. 
C) feasible form. 
D) alternative form.

Question 4

Consider the following linear programming problem
Max 8X + 7Y
s.t.15X + 5Y < 75
10X + 6Y < 60
X + Y < 8
X,Y $\ge$ 0
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&. b.The optimal solution o

Question 5

Use this graph to answer the questions. 
    Max 20X + 10Y 
s.t.12X + 15Y  ,Y > 0 
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 are zero?

Accepted Answer

a.Area III is the feasible reg

Question 6

Find the complete optimal solution to this linear programming problem.
Min 3X + 3Y 
s.t.12X + 4Y > 48
10X + 5Y > 50
4X + 8Y > 32
X ,Y > 0

Accepted Answer

@#IMG-DLM& 
The complete optim

Question 7

An infeasible problem is one in which the objective function can be increased to infinity.

Accepted Answer

A) True 
 B)False

Question 8

Does the following linear programming problem exhibit infeasibility,unboundedness,or alternate optimal solutions? Explain.
Min 1X + 1Y
s.t.5X + 3Y  36
Y  0

Accepted Answer

The proble

Question 9

Alternative optimal solutions occur when there is no feasible solution to the problem.

Accepted Answer

A) True 
 B)False

Question 10

Find the complete optimal solution to this linear programming problem.
Max 5X + 3Y 
s.t.2X + 3Y   - 5Y  ,Y > 0

Accepted Answer

@#IMG-DLM& 
The complete optim

Question 11

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 12

It is possible to have exactly two optimal solutions to a linear programming problem.

Accepted Answer

A) True 
 B)False

Question 13

The maximization or minimization of a quantity is the

Accepted Answer

A) goal of management science. 
B) decision for decision analysis. 
C) constraint of operations research. 
D) objective of linear programming. 
A) goal of management science. 
B) decision for decision analysis. 
C) constraint of operations research. 
D) objective of linear programming.

Question 14

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

Accepted Answer

A) True 
 B)False

Which of the following statements is NOT true?

Does the following linear programming problem exhibit infeasibility,unboundedness,or alternate optimal solutions? Explain. Min 3X + 3Y s.t.1X + 2Y < 16 1X + 1Y < 10 5X + 3Y < 45 X ,Y > 0

Whenever all the constraints in a linear program are expressed as equalities,the linear program is said to be written in

Use this graph to answer the questions. Max 20X + 10Y s.t.12X + 15Y < 180 15X + 10Y < 150 3X - 8Y < 0 X,Y > 0 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 are zero?

Find the complete optimal solution to this linear programming problem. Min 3X + 3Y s.t.12X + 4Y > 48 10X + 5Y > 50 4X + 8Y > 32 X,Y > 0

An infeasible problem is one in which the objective function can be increased to infinity.

Does the following linear programming problem exhibit infeasibility,unboundedness,or alternate optimal solutions? Explain. Min 1X + 1Y s.t.5X + 3Y < 30 3X + 4Y > 36 Y < 7 X ,Y > 0

Alternative optimal solutions occur when there is no feasible solution to the problem.

Find the complete optimal solution to this linear programming problem. Max 5X + 3Y s.t.2X + 3Y < 30 2X + 5Y < 40 6X - 5Y < 0 X,Y > 0

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

It is possible to have exactly two optimal solutions to a linear programming problem.

The maximization or minimization of a quantity is the

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

Introduction

Introduction to Probability

Probability Distributions

Decision Analysis

Utility and Game Theory

Forecasting

Lp Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications

Distribution and Network Problems

Integer Linear Programming

Advanced Optimization Application

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Markov Processes

Filters

Exam 7: Introduction to Linear Programming

Which of the following statements is NOT true?

Does the following linear programming problem exhibit infeasibility,unboundedness,or alternate optimal solutions? Explain. Min 3X + 3Y s.t.1X + 2Y < 16 1X + 1Y < 10 5X + 3Y < 45 X ,Y > 0

Whenever all the constraints in a linear program are expressed as equalities,the linear program is said to be written in

Use this graph to answer the questions. Max 20X + 10Y s.t.12X + 15Y < 180 15X + 10Y < 150 3X - 8Y < 0 X ,Y > 0 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 are zero?

Find the complete optimal solution to this linear programming problem. Min 3X + 3Y s.t.12X + 4Y > 48 10X + 5Y > 50 4X + 8Y > 32 X ,Y > 0

An infeasible problem is one in which the objective function can be increased to infinity.

Does the following linear programming problem exhibit infeasibility,unboundedness,or alternate optimal solutions? Explain. Min 1X + 1Y s.t.5X + 3Y < 30 3X + 4Y > 36 Y < 7 X ,Y > 0

Alternative optimal solutions occur when there is no feasible solution to the problem.

Find the complete optimal solution to this linear programming problem. Max 5X + 3Y s.t.2X + 3Y < 30 2X + 5Y < 40 6X - 5Y < 0 X ,Y > 0

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

It is possible to have exactly two optimal solutions to a linear programming problem.

The maximization or minimization of a quantity is the

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

Introduction

Introduction to Probability

Probability Distributions

Decision Analysis

Utility and Game Theory

Forecasting

Lp Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications

Distribution and Network Problems

Integer Linear Programming

Advanced Optimization Application

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Markov Processes

Filters

Use this graph to answer the questions. Max 20X + 10Y s.t.12X + 15Y < 180 15X + 10Y < 150 3X - 8Y < 0 X,Y > 0 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 are zero?

Find the complete optimal solution to this linear programming problem. Min 3X + 3Y s.t.12X + 4Y > 48 10X + 5Y > 50 4X + 8Y > 32 X,Y > 0

Find the complete optimal solution to this linear programming problem. Max 5X + 3Y s.t.2X + 3Y < 30 2X + 5Y < 40 6X - 5Y < 0 X,Y > 0

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