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

Assigment Program Linear

The document describes several linear programming problems involving optimal production allocation. The first problem involves maximizing profit from two products given constraints on production processes. The optimal solution produces 52.94 units of Product 1 and 14.12 units of Product 2 for a total profit of $148.24. Other problems provide optimal allocations for investment portfolios, allocating time between work and leisure, and determining optimal product mixes for various manufacturing scenarios.

Uploaded by

arya ibrahim
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
93 views

Assigment Program Linear

The document describes several linear programming problems involving optimal production allocation. The first problem involves maximizing profit from two products given constraints on production processes. The optimal solution produces 52.94 units of Product 1 and 14.12 units of Product 2 for a total profit of $148.24. Other problems provide optimal allocations for investment portfolios, allocating time between work and leisure, and determining optimal product mixes for various manufacturing scenarios.

Uploaded by

arya ibrahim
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

PROGRAMA LINEAR

GROUP :

1. Michael Alfoncus Liquori S S


2. Arya Ibrahim Aji
3. Evi Margaretha
4. Mutiara

ASSIGMENT I
PASCASARJANA TEKNIK INDUSTRI Universitas Indonesia
PROBLEM SET 2.2A
4. A company that operates 10 hours a day manufactures two proucts on three sequential
processes. The following table summarizes the data problem:

Determine the optimal mix of the two products.

ANSWER :
X1 = Daily units of Product 1
X2 = Daily units of Product 2
Maximize Z = 2X1 + 3X2
10X1 + 5X2 ≤ 600 (1)
6X1 + 20X2 ≤ 600 (2)
8X1 + 10X2 ≤ 600 (3)

Optimum Occurs at A:
X1 = 52.94 X2 = 14.12
Z = $ 148.24

7. An individual wishes to invest $5000 over the next year in two types of investment:
Investment A yields 5% and investment B yields 8%. Market research recommends an
allocation of at least 25% in A at most 50% in B. Moreover, investment in A should be at
least half the investment in B. How should the fund be allocated to the two investmants?

ANSWER :
X1 = $ invested in A
X2 = $ invested in B
Maximize Z = 0.5X1 + 0.8X2
X1 ≥ 25 (X1 + X2)
X2 ≤ 5 (X1 + X2)
X1 ≥ 5 X2
X1 + X2 ≤ 5000
X1 , X2 ≥ 0

Optimum :
X1 = $2500
X2 = $ 2300
Z = $325
11. Jack is an aspiring freshman at Ulern University. He realizes that “all work and no play
make Jack a dull boy. As a result, Jack wants to apportion his available time of obout 10
hours a day between work and play. He estimates that play is twice as much fun as work.
He also wants to study at least as much as he plays. However, Jack realized that if he is
going to get all his homework assignments done, he cannot play more than 4 hours a day.
How should Jack allocate his time to maximize his pleasure from both work and play?

ANSWER :
X1 = Play hours per day
X2 = Work hours per day
Maximize Z = X1 + X2
X1 + X 2 ≤ 10
X1 - X2 ≤ 0
X1 ≤ 4
X1 , X2 ≥ 0

Optimum Solution :
X1 = 4 hours Z = 14 “Pleasarits”
X2 = 6 hours

17. A furniture company manufactures desks and chairs. The sawing department cuts the
lumber for both products, which is then sent to separate assembly departments.
Assembled items are sent for finishing to the painting department. The daily capacity
of the sawing department is 200 chairs or 80 desks. The chair assembly department
can produce 120 chairs daily and the desk assembly department 60 desks daily. The
paint department has a daily capacity of either 150 chairs or 110 desks. Given that the
profit per chair is $50 and that of a desk is $100, determine the optimal production
mix for the company.

ANSWER :
X1 = Nbr of Desks per day
X2 = Nbr of Chairs per day
Maximize Z = 50X1 + 100X2
𝑋1 𝑋2
+ ≤ 1 (1)
200 80
𝑋1 𝑋2
+ ≤ 1 (2)
150 110

X1 ≤ 120 (3)
X2 ≤ 60 (4)
Optimum :
X1 = 90 Desks Z = $8900
X2 = 44 Chairs
PROBLEM SET 2.2B
6. Day Trader wants to invest a sum of money that would generate an annual yield of at
least $10.000. Two stock groups are available: blue chips and high-tech, with average
annual yields of 10% and 25%, respectively. Though high-tech stocks provide higher yield,
they are more risky, and Trader wants to limit the amount invested in these stocks to no
more than 60% of the total investment. What is the minimum amount Trader should
invest in each stock group to accomplish the investment goal?

ANSWER :
X1 = 103$ Invested in blue chip stock
X2 = 103$ Invested in high-tech stock
Maximize Z = X1 + X2
Subject to 1X1 + 25X2 ≥ 10
6X1 - 4X2 ≥ 0
X1 , X 2 ≥ 0
Optimal Solution:
X1 = 21.05 Z = 52.63
X2 = 31.58

PROBLEM SET 2.3A


1. A realtor is developing a rental housing and retail area. The housing area consists of
efficiency apartments, duplexes and single-family homes. Maximum demand by potential
renters is estimated to be 500 efficiency apartments, 300 duplexes, and 250 single-family
homes, but the number of duplexes must equal at least 50% of the number of efficiency
apartments and single homes. Retail space is proportionate to the number of home units
at the rates of at least 10 ft2, 15 ft2, and 18 ft2 for efficiency, duplex, and single family
units, respectively. However, land availability limits retail space to no more than 10.000
ft2. The monthly rental income is estimated at $600, $750, and $1200 for efficiency,
duplex and single-family units, respectively. The retail space rents for $100/ft2.
Determine the optimal retai space area and the number of family residences.

ANSWER :
Xe = Nbr of efficiency Apartments
Xd = Nbr of Duplexes
Xs = Nbr of Single-family homes
Xr = Retail space in ft2
Maximize Z = 600Xe + 700Xd + 1200Xs + 100Xr
Subject to Xe ≤ 500, Xd ≤ 300, Xs ≤ 250
Xr ≥ 10Xe + 15Xd + 18Xs
Xr ≤ 1000
𝑋𝑒 + 𝑋𝑠
𝑋𝑑 ≥
2
Xe , Xd , Xs , Xr. ≥ 0
Optimal Solution:
Xe = 207.14 Xd = 228.57
Xs = 250 Xr = 10.000
Z = 1.595.714,29
LP does not guarantee integer solution use rounded solution or apply integer LP algorithm.

PROBLEM SET 2.3D


3. A manufactur produces three models, I, II, III, of a certain product using raw materials
A and B. The following table gives the data for the problem:

The labor time per unit of model I is twice that of II and three times that of III. The entire
labor force of the factory can produce the equivalent of 1500 units of model I. Market
requirements specify the ratios 3:2:5 for the production of the three respective models.
Formulate the problem as a linear program, and find the optimum solution.
ANSWER :
Xj = Number of units of model j
Maximize Z = 30X1 + 20X2 + 50X3
Subject to
2X1 + 3X2 + 5X3 ≤ 4000 (1)
4X1 + 2X2 + 7X3 ≤ 6000 (2)
1
X1 + 5X2 + X3 ≤ 1500 (3)
3
X1 X2
= or 2X1 – 3X2 = 0 (4)
3 2
X2 X3
2
= 5
or 5X2 – 2X3 = 0 (5)
X1 ≥ 200 , X2 ≥ 200 , X3 ≥ 150
Optimal Solution sumarry:

You might also like