Scribd
Upload
78 views

1 (I) - Unbounded - Since There Is No Single Poiny in Feasible Region That Can Maximize The Function

This document contains 4 problems involving linear programming formulations to maximize profit or minimize costs. Problem 1 involves graphically solving 4 LPs and identifying the type of solution. Problems 2-4 involve formulating LPs to minimize costs for a chemical production problem, maximize profit for furniture production given resource constraints, and maximize revenue for a brewery given material constraints. The key elements of each LP - objective function, constraints, variables - are defined for each problem.

Uploaded by

Polu Vidya Sagar
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
78 views

1 (I) - Unbounded - Since There Is No Single Poiny in Feasible Region That Can Maximize The Function

This document contains 4 problems involving linear programming formulations to maximize profit or minimize costs. Problem 1 involves graphically solving 4 LPs and identifying the type of solution. Problems 2-4 involve formulating LPs to minimize costs for a chemical production problem, maximize profit for furniture production given resource constraints, and maximize revenue for a brewery given material constraints. The key elements of each LP - objective function, constraints, variables - are defined for each problem.

Uploaded by

Polu Vidya Sagar
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Problem 1) Graphically solve the following LPs and identify which of Cases 1-4 (Unique,

Many, Infeasible, Unbounded) apply.


Answer:
1(i) Unbounded since there is no single poiny in feasible region that can maximize the
function.
max = 51 2

S.t

1 32 0
21 + 32 12
1, 2 0

Z=30

Z=40

7
6

LP solution is
unbounded since
there isno single
point in feasible
region that can
maximize the
function.

5
4
1 32 0

21+ 32 12

3
2
1
0
1

1(ii)-Unique Solution with Z=12(0,6)

10

z=32

z=12
min = 61+ 22

min = 61+ 22

10

31+ 22 12

s.t 21+ 42 12
1,2 0
2 1

8
7

31+ 22 12

(6,0)
Given LP has
unique solution
with minimumZ
value of 12with
coordinates(0,6)

5
4
3
2
2 1

1
21 + 42 12

0
1

1(iii) Many Solutions- since function Z lies on the minimum Z line


= 18
min = 41 + 2

= 12
13
min = 41 + 2

12

s.t 31 + 22 6
41 + 2 12

11

2 2
1,2 0

10
41 + 2 12 9
8

Given LP has many


solutions because
minimization function
Z lies on the line with
minimum Z
value.Value of Z
remains same that is
12 for any point on
the line.

7
6
5
4
3
2 2

2
31 + 22 6

1
0
1

10

1(iv) Unbounded- Since Z has many minimum arbitrary values in the feasible region
1 4

min = 1 22
. 1 + 2 8
1 2 6
1 4
1,2 0

= 5

1 + 2 8

= 4

7
6

=5

5
4

Given LP is unbounded.In
the feasible region, Z has
many minimum arbitary
values.

3
2
1

1 2 6

0
1

Problem 2) Leary Chemical manufactures three chemicals: A, B, and C. These chemicals are
produced via two production processes: 1 and 2. Running process 1 for an hour costs $4 and
yields 3 units of A, 1 of B and 1 of C. Running process 2 for an hour costs $1 and produces 1
unit of A and 1 of B. To meet customer demands, at least 10 units of A, 5 of B, and 3 of C must
be produced daily. Formulate an LP that determines a daily production plan that minimizes the
cost of meeting Leary Chemicals daily demands.
Answer:
Given:
Product
Running Process 1/hour yields (units)
Running Process 2/hour yields (units)

A
3
1

C
1
1

1
0

Running Process 1 per hour cost = $4


Running Process 2 per hour cost = $1
Also, at least 10 units of A, 5 of B, and 3 of C must be produced daily.
Let X1 be number of hours of running process 1
X2 be number of hours of running process 2
Formulation:
To minimize cost:
Min= 4X1+X2

Constraints:
3X1+X210 (Constraint on chemical A)
X1+X25 (Constraint on chemical B)
X13 (Constraint on chemical C)
X1, X2 0 (Sign Restriction)
Problem 3) Furnco manufactures desks and chairs. Each desk uses 4 units of wood, and each
chair uses 3. A desk contributes $40 to profit, and a chair contributes $25. Marketing
restrictions require that the number of chairs produced be at least twice the number of desks
produced. If 20 units of wood are available, formulate an LP to maximize Furncos profit.
Answer:
Given:
Product
Profit per each unit
Wood Consumption per unit

Desk
40
4

Chair
25
3

Available quantity of wood = 20 units


Number of chairs should be at least twice the number of desks produced.
Let X1 be number of units of Desk
X2 be number of units of chair
Formulation:
To maximize revenue:
Max= 40X1+25X2
Constraints:
4X1+3X2 20 (Constraint on Wood)
2X1 X2 => 2X1- X20 (Marketing Restriction)
X1, X2 0 (Sign Restriction)
Problem 4) Bloomington Breweries produces beer and ale. Beer sells for $5 per barrel, and ale
sells for $2 per barrel. Producing a barrel of beer requires 5 lbs of corn and 2 lbs of hops.
Producing a barrel of ales requires 2 lbs of corn and 1 lb of hops. Sixty lbs of corn and 25 lbs
of hops are available. Formulate an LP that can be used to maximize revenue.
Answer:
Given:
Product
Profit per barrel
Corn Consumption per barrel (lbs)
Hops consumption per barrel (lbs)

Bee
r
5
5
2

Ale
2
2
1

Available quantity of corn (in lbs) = 60


Available quantity of hops (in lbs) = 25
Let X1 be number of barrels of beer
X2 be number of barrels of ale
Formulation:
To maximize revenue:
Max= 5X1+2X2
Constraints:
5X1+2X2 60 (Constraint on Corn)
2X1+X225 (Constraint on Hops)
X1, X2 0 (Sign Restriction)

You might also like