Scribd
Upload
29 views1 page

Assignment-1 MCA

This document contains an assignment for a Quantitative Techniques course involving linear programming problems (LPP). It includes 8 questions asking students to: 1) Define degeneracy and non-degeneracy in LPP and explain the feasible region and artificial variables. 2) Use the simplex method to solve two LPP problems and find the geometrical interpretation and solution for another. 3) Solve another LPP using the simplex method. 4) Formulate an LPP to maximize profit for a firm manufacturing 3 products under machine time and production constraints.

Uploaded by

anon_157906176
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
29 views1 page

Assignment-1 MCA

This document contains an assignment for a Quantitative Techniques course involving linear programming problems (LPP). It includes 8 questions asking students to: 1) Define degeneracy and non-degeneracy in LPP and explain the feasible region and artificial variables. 2) Use the simplex method to solve two LPP problems and find the geometrical interpretation and solution for another. 3) Solve another LPP using the simplex method. 4) Formulate an LPP to maximize profit for a firm manufacturing 3 products under machine time and production constraints.

Uploaded by

anon_157906176
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

NATIONAL INSTITUTE OF SCIENCE & TECHNOLOGY

PALUR HILLS, BRAHMAPUR – 761008


ASSIGNMENT – 1
SUBJECT: Quantitative Technique -1(Operation Research)
SUBJECT CODE: MCC :405 BATCH: 2009
SEMESTER: FIRST
LAST DATE OF SUBMISSION: 09/03/2011
1.
(a) Define Degeneracy and Non-Degeneracy in LPP?
(b) What is feasible Region? Is it necessary that it should be always a convex set?
(c) Explain the artificial variable and its use in LPP?
(d) Write down the fundamental conditions on which the simplex Method is based.
(e) Determine the feasible space for the following constraints, given
That x1 , x 2 ≥ 0
− 3 x1 + x 2 ≤ 6
x1 − 2 x 2 ≥ 5
x1 − x 2 ≤ 0
(f) How you detect the unbounded solution in Graphical Method.
(g) Write the formula for ∆j.
(h) How you will select the leaving variable and entering variable in
Simplex table.
2. Use Simplex method to solve the LPP:
Maximize Z=3 x1 + 2x 2 subject to
x1 + x 2 ≤ 4
x1 − x 2 ≤ 2
x1 ≥ 0, x 2 ≥ 0
3. Find a geometrical interpretation and solution as well for the following LP
Problem. Maximize Z= 3 x1 + 5 x 2
Subject to
x1 + 2 x 2 ≤ 2000
x1 + x 2 ≤ 1500
x 2 ≤ 600
x1 ≥ 0, x 2 ≥ 0
4. Solve Max Z=2X1+X2 Subject to
4X1+3X2 ≤ 12
4X1+ X2 ≤8
4X1-X2 ≤8
5.. A firm manufactures have 3 products A, B and C.The profit are Rs.3, Rs.2, Rs.4
Respectively. The firm has 2 machines and below is the required processing time in
minutes for each machine on each product.
A B C
4 3 5 G (m/c)
2 2 4 H (m/c)
Machine G and H have 2,000 and 2500 machine minutes,respectively.the firm must
manufacture 100 A s,200 B s and 50 C s but not more then 150 A s.Set an L P problem
to maximize profit.
Good luck

You might also like