Scribd
Upload
1 views

Assignment 1

The document contains a series of assignment questions related to advanced Productions and Operations Management, focusing on optimization problems using graphical and simplex methods. It includes maximizing and minimizing objective functions under various constraints involving variables such as x and y. Additionally, it requests a note on the advantages and disadvantages of Linear Programming Problems (LPP).

Uploaded by

labate2413
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
1 views

Assignment 1

The document contains a series of assignment questions related to advanced Productions and Operations Management, focusing on optimization problems using graphical and simplex methods. It includes maximizing and minimizing objective functions under various constraints involving variables such as x and y. Additionally, it requests a note on the advantages and disadvantages of Linear Programming Problems (LPP).

Uploaded by

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

Assignment 1

Subject : Productions and Operations Management – advanced


Question 1:
Maximize the objective function Z = 8x + 12y subject to the following
constraints:
x+y≤9
x≥2
y≥3
3x + 6y ≤ 36
x,y ≥ 0.
(Note : Solve the Question with graphical method.)
Question 2:
A furniture maker produces tables and chairs .In preparing a table 10 man hours
are required and in preparing a chair 6 man are required. In a day maximum 300
man hours are available. One hour is required in polishing a chair or a table and
40 man hours are available for this. The profit on each table is rs. 12 and that on
each chair is rs 8. How many Chairs and table , he should produce to earn
maximum profit? (Note : Solve the Question with graphical method.)
Question 3:
Maximize Z = 10x1 + 15x2 + 8x3
Subject to,
X1 + 2x2 + 2x3 ≤ 90
2x1 + x2 + x3 ≤ 150
3x1 + x2 + 2x3 ≤ 70
x1, x2 , x3 ≥ 0
Question 4:
Minimize Z = - 40x1 – 100x2
Subject to,
2x1 + x2 ≤ 500
2x1 + 5x2 ≤ 1000
2x1 + 3x2 ≤ 900
x1, x2 ≥ 0
(Note : Solve the Question with Simplex method.)
Question 5:
Maximize Z = 3x1 + 2x2 + 5x3
Subject to,
x1 + x2 + x3 ≤ 9
2x1 + 3x2 + 5x3 ≤ 30
2x1 – x2 – x3 ≤ 8
x1, x2, x3 ≥ 0
Question 6 :
Write a note on Advantages and Disadvantages of LPP.

You might also like