Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
467 views

Assignment - Linear Programming

This document contains 5 questions involving linear programming problems. Question 1 asks to minimize an objective function subject to constraints. Question 2 involves maximizing profit from purchasing two products subject to budget and space constraints. Question 3 involves maximizing profit from producing three products subject to capacity constraints on machines. Question 4 asks to formulate the linear programming model from Question 3 and solve it using the simplex method. Question 5 asks to solve a linear programming problem by graphical and simplex methods.

Uploaded by

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

Assignment - Linear Programming

This document contains 5 questions involving linear programming problems. Question 1 asks to minimize an objective function subject to constraints. Question 2 involves maximizing profit from purchasing two products subject to budget and space constraints. Question 3 involves maximizing profit from producing three products subject to capacity constraints on machines. Question 4 asks to formulate the linear programming model from Question 3 and solve it using the simplex method. Question 5 asks to solve a linear programming problem by graphical and simplex methods.

Uploaded by

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

Quantitative Techniques for Managerial Decisions Khanna

Introduction to Operations Research: A Computer-oriented Algorithmic Approach

Assignment
Q.1

Q.2

f = 5x1 4x2 + 6x3 + 8x4

st.

x1 + 7x2 + 3x3 + 7x4 < 46


3x1 x2 + x3 + 2x4

<

2x1 + 3x2 - x3 + x4

<

10

x2 > 0, x3 > 0, x4 > 0

Minimize

f = 2x1 + 3x2 + x3

st.

x1 + 4x2 + 2x3 > 8


3x1 + 2x2
X1 > 0,

Q.3

Linear Programming

Maximize

X1 > 0,

By Billy E. Gillett

>

x2 > 0,

x3 > 0

A company wants to purchase at most 1800 units of a product. There are two
types of the product, M1 and M2 available.
M1 occupies 2ft3, costs Rs 4.0 and the company makes a profit of Rs. 3.0. M2
occupies 3ft3, cost Rs. 5.00 and the company makes a profit of Rs. 4.00. If the
budget is Rs. 5500/- and warehouse has explicitly 3000 ft3 for the product,
a) Formulate the problem as linear programming problem
b) Solve the problem by simplex method.

Q.4

A manufacturing firm has discontinued production of a certain unprofitable product


line. This created considerable excess production capacity. Management is
considering devoting this excess capacity to one or more of three products; call
them products 1, 2, 3. The available capacity on the machine that might limit
output is summarized in the following table:Machine type
Milling machine
Lathe
Grinder

Available time (machine hour per week)


500
350
150

The number of machine hours required for each unit of the respective products is:
Machine type
Milling machine
Lathe
Grinder

Product 1
9
5
3

Product 2
3
4
0

Product 3
5
4
2

The unit profit would be Rs. 30.00, Rs 12.00 and Rs. 19.00 respectively, on
product 1, 2, and 3.
a)
b)
Q.5

Formulate the Linear programming model for determining how much


of each product the firm should produce to maximize profit.
Solve the problem by the

Minimize

f = 5x1 + 2x2

St.

4x1 + x2

>

simplex method.

X1 + x2 < - 5
X1, x2
a)

> 0

Solve this problem by graphical method

b)

Solve this problem by simplex method

You might also like