Butcher Hall handout
Econ 446 Lab Feb. 13, 2009
Topic: Inference in the Simple Linear Regression Model
In todays class, you need to understand what is t test, you need to know the
difference between one tail test and two tail test. You also need to unders
Ch. 6 Integer Linear Programming
Chapter 6 Integer Linear Programming
An integrality condition indicates that some (or all) of the?
a. RHS values for constraints must be integer
b. objective function coefficients must be integer
Ch. 3 Modeling and Solving LP Problems in a Spreadsheet
Chapter 3 Modeling and Solving LP Problems in a Spreadsheet
An LP problem with a feasible region will have
a. an optimal solution at some interior point.
b. an optimal solution at
Ch. 1 Introduction to Modeling and Decision Analysis
Chapter 1 Introduction to Modeling and Decision Analysis
1. The essence of decision analysis is:
a. breaking down complex situations into manageable elements.
b. choosing the best c
Ch. 8 Nonlinear Programming
Chapter 8 Nonlinear Programming
The main difference between LP and NLP problems is that NLPs will have a
a. linear objective function and nonlinear or linear constraints.
b. nonlinear or linear objective func
Ch. 2 Introduction to Optimization and Linear Programming
Chapter 2 Introduction to Optimization and Linear Programming
What most motivates a business to be concerned with efficient use of their resources?
a. Resources are limited
Ch. 4 Sensitivity Analysis and the Simplex Method
Chapter 4 Sensitivity Analysis and the Simplex Method
When a manager considers the effect of changes in an LP model's coefficients he/she is performing
a. random analysis.
Ch 15 Decision Analysis
Chapter 15 Decision Analysis
1. Decision analysis supports all but one of the following goals. Which goal is not supported?
a. Help make good decisions.
b. Help ensure selection of good outcomes.
c. Analyze de
Ch. 5 Network Modeling
Chapter 5 Network Modeling
Almost all network problems can be viewed as special cases of the
a. transshipment problem.
b. shortest path problem.
c. maximal flow problem.
d. minimal spanning tree problem.
MIDTERM EXAM 2 - A
TIME: 90 MINUTES
TYPE: WRITTEN AND OPEN BOOK EXAM
EXAM CODE: 02
I. QUESTION 1: True or False
Variables whose only possible values are 0 and 1 are called binary variables (T)
Each node in a minimum cost flow problem where the net