Scribd
Upload
44 views3 pages

Department of Mathematics and Philosophy of Engineering MPZ 5230 Engineering Mathematics III Assignment No.04

This document contains instructions for a linear programming assignment with 5 questions. It includes 3 multi-part linear programming problems to solve using graphical and simplex methods, formulation of a 2-product manufacturing problem as a linear program, and solving a linear program using the two-phase simplex method.

Uploaded by

Pinkk Daisyfield
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
44 views3 pages

Department of Mathematics and Philosophy of Engineering MPZ 5230 Engineering Mathematics III Assignment No.04

This document contains instructions for a linear programming assignment with 5 questions. It includes 3 multi-part linear programming problems to solve using graphical and simplex methods, formulation of a 2-product manufacturing problem as a linear program, and solving a linear program using the two-phase simplex method.

Uploaded by

Pinkk Daisyfield
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Department of Mathematics and Philosophy of Engineering

MPZ 5230 Engineering Mathematics III


Assignment No.04

Due Date: 06.06.2015

Academic Year 2014/2015

Instructions
Answer All Questions
Show all your workings
All symbols are in standard notations
Write your address back of your answer scripts
1. Determine the optimal solution of the following linear programming problems using
graphical method:
(a) Minimize Z = 5x1 3x2 .
Subject to

3x1 + 5x2 15,


5x1 + 2x2 10,
x1 , x2 0.

(b) Maximize Z = 2x1 + 2x2 ,


Subject to x1 x2 1
0.5x1 + x2 2,
x1 , x2 0
1

(c) Consider the following linear programming problem:


Maximize Z = 2x1 + x2
Subject to x1 3x2 3,
x1 8,
2x1 + x2 20,
x1 + 3x2 30,
x1 + x2 6,
x1 , x2 0.
(i) Plot the feasible region and verify the optimal solution.
(ii) What is the result if the third constraint is omitted? Justify your answer.
2. A furniture manufacturer makes two types of sofas-sofa of type A and sofa of type
B. For simplicity, divide the production process into three distinct operations, say
carpentry, finishing and upholstery. The amount of labor required for each operation
varies. Manufacturer of sofa of type A requires 6 hours of carpentry, 1 hour of finishing
and 2 hours of upholstery. Manufacturer of a sofa of type B requires 3 hours of
carpentry, 1 hour of finishing and 6 hours of upholstery. Owing to limited availability
of skilled labor as wells as of tools and equipments, the factory has available each day
96 man hours of carpentry, 18 man hours for finishing and 72 man hours for upholstery.
The profit per sofa of type A is Rs.80 and the profit per sofa of type B is Rs.70.
(i) Formulate the linear programming model for this problem to maximize the profit
per day.
(ii) Plot the feasible region and verify the optimal solution.
3. Solve the following linear programming problems using Simplex method:
(b) Minimize Z = 3x1 2x2 ,

(a) Maximize Z = x1 + 2x2 + x3 ,


Subject to 2x1 + x2 x3 2,

Subject to

2x1 + x2 5x3 6,

x1 3,
2x1 + x2 6,

4x1 + x2 + x3 6,

x2 2,

x1 , x2 , x3 0.

x1 + x2 3,
2

x1 , x2 0.

4.

(i) Consider the following linear Programming problems and solve using the Dual
Simplex Method.
(a) Maximize Z = 5x1 + 4x2 + 3x3 ,

(b) Minimize Z= 2x1 + 3x2 + 4x3 + 5x4 ,

Subject to 2x1 + 3x2 + x3 5,

Subject to x1 x2 + x3 x4 10,

4x1 + x2 + 2x3 11,

x1 2x2 +3x3 4x4 6,

3x1 + 4x2 + 2x3 8,

3x1 4x2 +5x3 6x4 15,

x1 , x2 , x3 0.

x1 , x2 , x3 , x4 0.

(ii) Consider the following Linear Programming problem and solve it using the dual
problem.
Maximize Z = 2x1 + x2 ,
Subject to x1 + 2x2 10,
x1 + x2 6,
x1 x2 2,
x1 2x2 1,
x1 , x2 0.
5. Use the Two-Phase Simplex method to solve the following linear programming problem:
Maximize Z = 2x1 + 5x2 ,
Subject to 3x1 + 2x2 6,
2x1 + x2 6,
x1 , x2 0.

You might also like