0% found this document useful (0 votes)
204 views

Matrices 8.1 Geometrical Introduction To Linear Programming

This document contains summaries of 13 linear programming problems involving maximizing or minimizing objectives subject to various constraints. The problems involve optimizing production schedules to maximize profit for companies manufacturing calculators and refrigerators. Another problem involves a tailor optimizing production of suits and dresses to maximize income given material constraints.

Uploaded by

xxambertaimexx
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
204 views

Matrices 8.1 Geometrical Introduction To Linear Programming

This document contains summaries of 13 linear programming problems involving maximizing or minimizing objectives subject to various constraints. The problems involve optimizing production schedules to maximize profit for companies manufacturing calculators and refrigerators. Another problem involves a tailor optimizing production of suits and dresses to maximize income given material constraints.

Uploaded by

xxambertaimexx
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Matrices, Vectors and Applications Homework

Section 8.1 A Geometrical Introduction to Linear Programming


Problems 1, 3, 5, 6, 8, 9, 11, 13

Linear Programming and Geometry


Solve the linear programming problems
1. Maximize fx=2x+y subject to
4x+y≤364x+3y≤60
x≥0, y≥0

3. Maximize fx=4x+2y subject to


x+3y≤152x+y≤10
x≥0, y≥0

5. Maximize fx=4x+y subject to


2x+y≤46x+y≤8
x≥0, y≥0

6. Minimize fx=-3x-y subject to


x+y≤1504x+y≤450
x≥0, y≥0
8. Minimize fx=-x+2y subject to
x+2y≤4x+4y≤6
x≥0, y≥0

Applications of Linear Programming


9. A company manufactures two types of hand calculators, model
C1 and model C2. It takes 1 hour and 4 hours in labor time to manufacture each C1 and C2
respectively. The cost of manufacturing the C1 is $30 and that of manufacturing a C2 is $20. The
company has 1600 hours of labor time available and $18,000 in running costs. The profit on each C1
is $10 and on each C2 is $8. What should the production schedule be to ensure maximum profit?

11. A refrigerator company has two plants at towns X and Y. Its refrigerators are sold in a certain town Z.
It takes 20 hours (packing, transportation and so on) to transport a refrigerator from X to Z and 10
hours from Y to Z. It cost $60 to transport each refrigerator from X to Z, and $10 per refrigerator
from Y to Z. There is a total of 1200 hours of labor time available and a total of $2400 is budgeted
for transportation. The profit on each refrigerator from X is $40 and the profit on each refrigerator
from Y is $20. How should the company schedule the transportation of refrigerators so as to
maximize profit?

13. A tailor has 80 square yards of cotton material and 120 square yards of woolen material. A suit
requires 2 square yards of cotton and 1 square yard of wool. A dress requires 1 square yard of cotton
and 3 square yards of wool. How many of each garment should the tailor make to maximize income,
if a suit and a dress each sell for $90? What is the maximum income?

You might also like