Chapter 2
Problem Summary
Prob. #
Concepts Covered
Level of
Difficult
y
Notes
2.1
Maximization production model
2
2.2
Maximization model, shadow prices, sensitivity
of the objective function coefficients
3
2.3
Alternate optimal solutions
5
2.4
Maximization model, calculation of objective
function coefficients, evaluating the
profitability of alternatives using shadow prices
6
2.5
Maximization model, calculation of objective
function coefficients, interpretation of shadow
prices for sunk and included costs
6
2.6
Maximization problem, redundant constraints,
checking the validity of model assumptions,
elimination of binding constraints, reduced
costs
5
2.7
Graphing constraints, interior points, infeasible
points, extreme points
4
2.8
Minimization model, interpretation of range of
optimality and shadow prices, infeasibility
5
2.9
Blending model, calculation of objective
function coefficients, interpretation of shadow
prices
5
2.10
Minimization model, evaluating alternatives
without using linear programming
3
2.11
Maximization model
2
2.12
Use of two models to compare policies
4
2.13
Maximization model, analysis of left side
values
3
2.14
Maximization model, determining the right
units for the constraints
5
2.15
Maximization integer model
3
2.16
Different objective functions for same set of
constraints
3
2.17
Minimization model
4
2.18
Including a constant in the objective function
4
2.19
Maximization model, reduced costs, sensitivity
analyses
4
2.20
Maximization model, calculation of objective
function coefficients
5
2.21
Unbounded feasible region with optimal and
unbounded solutions, checking model
integrality assumption
4
2.22
Sensitivity analyses, use of shadow prices,
100% rule, checking integrality assumption
6
2.23
Maximization investment model
4
2.24
Maximization model, interpretation of range of
feasibility, changes outside this range
4
2.25
Alternate optimal solutions
6
Chapter 2  1
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document2.26
Maximization model, range of optimality,
shadow prices, sunk and included costs
5
2.27
Adding constraints, adding variables, reduced
costs
6
2.28
Maximization model, evaluating slack and
surplus
4
2.29
Sensitivity analyses, interpretation, elimination
of a binding constraint
5
2.30
Linear solution is integer solution
2
2.31
Rounding linear solutions; optimal integer
solution is not a rounded solution
4
To get the right answer adjust the
tolerance in the Options dialogue box
from 5% to .01%; otherwise Excel will
give a wrong number
2.32
Mixed integer model
4
2.33
Maximization production model, rounding
4
2.34
Minimization model, rounded solution is not the
optimal solution
4
To get the right answer adjust the
tolerance in the Options dialogue box
from 5% to .01%; otherwise Excel will
give a wrong number
2.35
Linear model has integer extreme points,
evaluation of sensitivity information
6
2.36
Sensitivity of RHS in integer models
5
2.37
Addition of a variable in a linear/integer model
5
2.38
Maximization model, locating feasible integer
solutions on a graph, sensitivity results
This is the end of the preview.
Sign up
to
access the rest of the document.
 Fall '10
 C
 Operations Research, Linear Programming, Optimization, optimality

Click to edit the document details