Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
213 views

Assignment 1

This document outlines 10 problems involving linear programming models. For each problem, students are asked to either formulate a linear programming model, solve a model using the graphical method, or work through the simplex method. Some problems involve multiple parts asking students to draw graphs, find equations, or verify optimal solutions. The overall document presents a series of word problems relating to linear programming and asks students to apply different techniques to represent and solve the described models.

Uploaded by

Frustrated engineer
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
213 views

Assignment 1

This document outlines 10 problems involving linear programming models. For each problem, students are asked to either formulate a linear programming model, solve a model using the graphical method, or work through the simplex method. Some problems involve multiple parts asking students to draw graphs, find equations, or verify optimal solutions. The overall document presents a series of word problems relating to linear programming and asks students to apply different techniques to represent and solve the described models.

Uploaded by

Frustrated engineer
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Assignment # 1

1. Consider the following problem.

(a) Solve this problem graphically.


(b) Develop a table giving each of the CPF solutions and the corresponding defining equations, BF solution, and
nonbasic variables.

2. Each of the following statements is true under most circumstances, but not always. In each case, indicate when
the statement will not be true and why.
(a) The best CPF solution is an optimal solution.
(b) An optimal solution is a CPF solution.
(c) A CPF solution is the only optimal solution if none of its adjacent CPF solutions are better (as measured by the
value of the objective function).

3. Consider the original form (before augmenting) of a linear programming problem with n decision variables (each
with a nonnegativity constraint) and m functional constraints. Label each of the following statements as true or
false
(a) If a feasible solution is optimal, it must be a CPF solution.

(b) The number of CPF solutions is at least


(c) If a CPF solution has adjacent CPF solutions that are better (as measured by Z), then one of these adjacent CPF
solutions must be an optimal solution.

4. Work through the simplex method step by step to solve the following problem
5. Consider the following objective function for a linear programming model:

Maximize Z = 2x1 +3x2

(a) Draw a graph that shows the corresponding objective function lines for Z = 6, Z =12, and Z = 18.
(b) Find the slope-intercept form of the equation for each of these three objective function lines. Compare the slope
for these three lines. Also compare the intercept with the x2 axis.

6. Use the graphical method to solve the problem

7. Use the graphical method to solve the problem

8. The Apex Television Company has to decide on the number of 27- and 20-inch sets to be produced at one of its
factories. Market research indicates that at most 40 of the 27-inch sets and 10 of the 20-inch sets can be sold per
month. The maximum number of work-hours available is 500 per month. A 27-inch set requires 20 work-hours
and a 20-inch set requires 10 work-hours. Each 27-inch set sold produces a profit of $120 and each 20-inch set
produces a profit of $80. A wholesaler has agreed to purchase all the television sets produced if the numbers do
not exceed the maxima indicated by the market research.

(a) Formulate a linear programming model for this problem.


(b) Use the graphical method to solve this model.

9. The WorldLight Company produces two light fixtures (products 1 and 2) that require both metal frame parts and
electrical components. Management wants to determine how many units of each product to produce so as to
maximize profit. For each unit of product 1, 1 unit of frame parts and 2 units of electrical components are required.
For each unit of product 2, 3 units of frame parts and 2 units of electrical components are required. The company
has 200 units of frame parts and 300 units of electrical components. Each unit of product 1 gives a profit of $1,
and each unit of product 2, up to 60 units, gives a profit of $2. Any excess over 60 units of product 2 brings no
profit, so such an excess has been ruled out.

(a) Formulate a linear programming model for this problem.


(b) Use the graphical method to solve this model. What is the resulting total profit?

10. The Primo Insurance Company is introducing two new product lines: special risk insurance and mortgages. The
expected profit is $5 per unit on special risk insurance and $2 per unit on mortgages. Management wishes to
establish sales quotas for the new product lines to maximize total expected profit. The work requirements are as
follows:

(a) Formulate a linear programming model for this problem.


(b) Use the graphical method to solve this model.
(c) Verify the exact value of your optimal solution from part (b) by solving algebraically for the simultaneous
solution of the relevant two equations.

You might also like