Quantitative Analysis BA 452 Homework 1 Questions
1
Homework 1 covers the theory and applications in Lessons I-1 to I-3.
This document has four parts:
Objectives
of doing your homework.
Assignment
of homework questions, with suggestions about which
other questions may help you understand the homework questions.
Homework 1 Supplemented Questions
listing 58 questions: 4 of them
are your homework, others may help you understand the homework
questions, and the rest may help you understand fine points.
Some
supplemental questions refer to a section of a chapter in the textbook (for
example, Section 2.1 means Chapter 2 Section 1 of your textbook).
Homework 1 Supplemented Answers
listing answers to all 58
questions
excluding
your 4 homework questions.

This ** preview** has intentionally

**sections.**

*blurred***to view the full version.**

*Sign up*
Quantitative Analysis BA 452 Homework 1 Questions
2
Objectives
By working through the homework questions and the supplemental
questions, you will:
1.
Obtain an overview of the kinds of problems linear programming has been
used to solve.
2.
Learn how to develop linear programming models for simple problems.
3.
Be able to identify the special features of a model that make it a linear
programming model.
4.
Learn how to solve two variable linear programming models by the graphical
solution procedure.
5.
Understand the importance of extreme points in obtaining the optimal
solution.
6.
Know the use and interpretation of slack and surplus variables.
7.
Be able to interpret the computer solution of a linear programming problem.
8.
Understand how alternative optimal solutions, infeasibility and
unboundedness can occur in linear programming problems.
9.
Understand the following terms:
problem formulation
feasible region
constraint function
slack variable
objective function
standard form
solution
redundant constraint
optimal solution
extreme point
nonnegativity constraints
surplus variable
mathematical model
alternative optimal solutions
linear program
infeasibility
linear functions
unbounded
feasible solution