Scribd
Upload
115 views2 pages

LPP (DPP 1)

Uploaded by

Diganta Karak
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
115 views2 pages

LPP (DPP 1)

Uploaded by

Diganta Karak
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/ 2

9027569922

#1

1. Answer the following questions:

I. The function which has to be maximised or minimised in a LPP is called


______ function.
II. The common region determined by all the linear constraints of a linear
programming problem is called the _______ region.
III. Any point outside the feasible region is an ________ solution.
IV. The minimum value of the objective function 𝑧 = 𝑎𝑥 + 𝑏𝑦 in a LPP always
occur at one corner point of the feasible region. State true or false.
V. If an LPP admits two optimal solutions it has an infinite number of optimal
solutions. State true or false.
VI. If the feasible region for a linear programming problem is bounded, then the
objective function 𝑍 = 𝑎𝑥 + 𝑏𝑦 has both a maximum and a minimum value
on R. State true or false.
VII. In a LPP, the objective function is always ______.
VIII. In a LPP, the inequalities or restrictions on the variables are called _______.
IX. If the feasible region for a LPP is _______, then the optimal value of the
objective function 𝑧 = 𝑎𝑥 + 𝑏𝑦 may or may exist.
X. The feasible region for a LPP is always a _______ polygon.

2. Maximise the function Z = 11𝑥 + 7𝑦, subject to the constraints: 𝑥 ≤ 3, 𝑦 ≤ 2,


𝑥 ≥ 0, 𝑦 ≥ 0

3. Maximise 𝑍 = 4𝑥 + 3𝑦 subject to constraints


3𝑥 + 4𝑦 ≤ 24
8𝑥 + 6𝑦 ≤ 48
𝑥≤5
𝑦≤6
𝑥, 𝑦 ≥ 0
9027569922

4. Maximise 𝑍 = 7𝑥 + 10𝑦 subject to constraints


𝑥 + 𝑦 ≤ 30000
𝑦 ≤ 12000
𝑥 ≥ 6000
𝑥≥𝑦
𝑥, 𝑦 ≥ 0

5. Minimise 𝑧 = 𝑥 − 5𝑦 + 20 subject to constraints


𝑥−𝑦 ≥0
−𝑥 + 2𝑦 ≥ 2
𝑥≥3
𝑦≤4
𝑥, 𝑦 ≥ 0

6. Maximise 𝑍 = 3𝑥 + 4𝑦, if possible, subject to constraints


𝑥 − 𝑦 ≤ −1
−𝑥 + 𝑦 ≤ 0
𝑥, 𝑦 ≥ 0

ANSWER KEY
1. (I) Objective (II) Feasible (III) Infeasible

(IV) False (V) True (VI) True

(VII) Linear (VIII) Constraints (IX) Unbounded

(X) Convex

2. Maximum 𝑍 = 47 at (3,2)
24 27
3. Maximum 𝑍 = 24 at all points on the line segment joining the points ( , )
7 7
4
and (5, )
3

4. Maximum 𝑍 = 246000 at (18000, 12000)

5. Minimum 𝑍 = 4 at (4,4)

6. Does not exist

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy