question paper

© All Rights Reserved

46 views

question paper

© All Rights Reserved

- Decision Science Syllabus.pdf
- Operation Research
- or SOLUTIONS.docx
- A method for solving quadratic programming problems having linearly factorized objective function
- webchapB
- Assignment OR
- Transportation Model LP.ppt
- rsh_qam11_tif_09.doc
- Constraint Handling (Survey) in EC ZM
- Fluid Ad Joint
- Optimisation of thermal processing—a review.pdf
- Lewin Ski
- lmibook.pdf
- 20170719-WorkshopAssessment-Scratch2017BDX1
- Design_Optimization_using_Genetic_Algori.pdf
- 2_LinearProg 1.pdf
- Design Optimization of Tall Steel Buildings
- Scaling Social Media Applications Into Geo-Distributed Clouds
- Article - Net - Improved Comp Planning II 1979
- Neutrosophic Integer Programming Problem

You are on page 1of 2

Max. Marks - 60

The question paper contains three sections .All the questions are compulsory.

Sections - A

Q1.

( 1 x 15 = 15 )

(b) Scientific

(c) Institutive

(d) All of the above

Q2. Decision variables are:(a) Controllable

(b) Uncontrollable

(c) Parameters

(d) None of the above

Q3. The best use of linear programming technique is to find an optimal use of:(a) Money

(b) Manpower

(c) Machine

(d) All of the above

Q4. While solving a LP model graphically, the area bounded by the constraints is called:(a) Feasible region

(b) Infeasible region

(c) Unbounded solution

(d) None of the above

Q5. For a maximization problem, the objective function coefficient for an artificial variable is:(a) +M

(b) -M

(c) Zero

(d) None of the above

Q6. In the optimal simplex table Cj - Zj=0 value indicates:(a) Unbounded Solution

(b) Cycling

(c) Alternative Solution

(d) Infeasible Solution

Q7. For maximization LP Model, the simplex method is terminated when all values:(a) Cj - Zj 0

(b) Cj - Zj 0

(c) Cj-Zj =0

(d) Zj 0

Q8. If an artificial variable is present in the basic variable column of optimal simplex table then the

solution is:(a) Unbounded

(b) Infeasible

(c) Optimal

(d) None of the above

Q9. The graphical method of LP problem uses:(a) Objective function equation

(b) Constraint Equation

(c) Linear Equation

(d) All of the above

Q10. If a non-redundant constraint is removed from a LP problem, then:(a) Feasible region will become larger

(b) Feasible region will become smaller

(c) Solution will become infeasible

(d) None of these

Q11. Linear Programming is a:(a) Constrained optimization technique

(b) Technique for economic allocation of limited

resources

(c) Mathematical Techniques

(d) All of the above

Q12. Which of the following is not a characteristic of LP model:(a) Alternative courses of action

(b) An objective function of minimization type

(c) Limited amount of resources

(d) Non-negativity condition on the value of

decision variables

Q13. Managerial decisions are based on:(a) An evaluation of quantities data

(b) The use of qualitative factors

(c) Numbers produced by formal models

(d) All of the above

Constrconstraints

Q14.

in an LP model represents:(a) Limitations

(b) Requirements

(c) Balancing limitations and requirements (d) All of the above

Q15. Which of the following is the assumption of an LP model

(a) Divisibility

(c) Additively

(b)

(d)

Proportionality

All of the above

Section - B

(12.5 2 =25)

Q2. (a) Define Operations Research and discuss its scope.

(b) Solve the following LPP by Graphical method.

Q3.

S.t.

X1 + X2 2

5X1 + 2X2 10

3X1 + 8X2 12

X1, X2 0

(c) Find the dual of the following LPP

Min. Z = 2X2 + 5 X3

S.t.

X1 + X2 2

2X1+ X2 + 6 X3 6

X1 - X2 + 3 X3 = 4

X1, X2, X3 0

(a) What are the components of a linear programming problem? What do you

mean by non-negativity restrictions?

(b) A firm manufactures two type of products A and B and sells them at a

profit of Rs. 2 on type A and Rs. 3 on type B. Each product is processed

on two machines G and H. Type A requires one minute of

processing time

on G and two minutes on H; type B requires one

minute on G and one

minute on H. The machine G is available for

not more than 6 hrs. 40

minutes while machine H is

available for 10 hrs. during any working day.

Formulate the

problem as a linear programming problem.

(c) Solve the following by graphical method.

Maximize Z = - X1 +2 X2

S.t.

- X1 + X2 1

- X1 +2 X2 4

X1, X2 0

Section - C

Q4.Solve the following LPP by simplex method.

Maximize Z = 3 X1 + 5 X2

S.T.

3 X1 + 2 X2 18

X1 4

X2 6

X1, X2 0

OR

Use Big-M method to solve the following.

Maximize Z = 2 X1 + X2 + 3 X3

S.T.

X1 + X2 + 2 X3 5

.

X1 - X2 + 3 X3 = 4

X1, X2 , X3 0

(20 1 =20)

- Decision Science Syllabus.pdfUploaded bynileshstat5
- Operation ResearchUploaded byAyyappa Kattamuri
- or SOLUTIONS.docxUploaded byVishal Kumar
- A method for solving quadratic programming problems having linearly factorized objective functionUploaded byIJMER
- webchapBUploaded bytanvir09
- Assignment ORUploaded byZimri99
- Transportation Model LP.pptUploaded byKamal Uddin
- rsh_qam11_tif_09.docUploaded byJay Brock
- Constraint Handling (Survey) in EC ZMUploaded bybanstala
- Fluid Ad JointUploaded byaddafrr
- Optimisation of thermal processing—a review.pdfUploaded byAfini Exo K
- Lewin SkiUploaded bywiestan
- 20170719-WorkshopAssessment-Scratch2017BDX1Uploaded byYudhi Kurnia
- lmibook.pdfUploaded bycontrolman2013
- Design_Optimization_using_Genetic_Algori.pdfUploaded byDeepshikhaSingh
- 2_LinearProg 1.pdfUploaded byahmedelebyary
- Design Optimization of Tall Steel BuildingsUploaded bylucasgambi
- Scaling Social Media Applications Into Geo-Distributed CloudsUploaded byparry prabhu
- Article - Net - Improved Comp Planning II 1979Uploaded byAhmed Ismail
- Neutrosophic Integer Programming ProblemUploaded byMia Amalia
- Bsc ThesisUploaded byDavid Halomoan
- LP MethodsUploaded byespritzvino
- Tent2Uploaded byPETER
- Tutorial Sheet 3Uploaded byANMOL
- libro1Uploaded byValencia Luis Ernesto
- AARC 0Uploaded bycompadre97
- PP 108-111 Implementation of Genetic Algorithm in Dyamic Channel AllocationUploaded byEditorijset Ijset
- Course blow up.docxUploaded byRahul Sehgal
- 11Uploaded bytomk2220
- carpanetoUploaded byBenjamin Naula

- Mis notesUploaded bysangeet83
- Digital Marketing company.xlsxUploaded bysangeet83
- Quesion NaireUploaded bysangeet83
- Basic ComputerUploaded byShri Pandiyan
- Fundamentals of Computers Unit IIUploaded bysangeet83
- Cloud computingUploaded bysangeet83
- ASCUploaded bysangeet83
- List of placement consultantsUploaded byshivankj
- CBOTUploaded bysangeet83
- Question Bank,MosUploaded bysangeet83
- Question BankUploaded bysangeet83

- Differential Evolution with DEoptimUploaded bymtl0612
- 297 - TS - Chapter in Handbook of Combinatorial Optimization V3Uploaded byBedadipta Bain
- Multiclass Filters by a Weighted Pairwise CriterionUploaded byRaveendra Moodithaya
- ME CAD SyllabusUploaded bysubha_aero
- 01-01 Overview of Network OptimizationUploaded bySunil Kumar Karna
- _10_Evaluation of Different Bilevel Optimization Algorithms With-ThesisUploaded byGeraldo Rocha
- lecture1.pdfUploaded byron9123
- Get PDFUploaded bysleya
- Image Change Detection 14104136 14104055Uploaded byRoopa Lahari
- PT as I Still See It Clean Copy Markowitz 2010Uploaded byOVVOFinancialSystems
- ME Syllabus FT EPSUploaded byJAYESH
- Opt KnockUploaded byanthazar
- Sustainable Management of SavannaUploaded bynata_lu
- Linear Programming 01Uploaded byDinesh Priyanga
- 08080030Uploaded bysyed02
- Lesson Test for Optimal Solution to a Transportation ProblemUploaded byBindia Chandel
- adelaja - the political economy of downzoningUploaded byJames Felton Keith
- 2005 Optimal placement and sizing of distributed generation on radial feeder with different static load models.pdfUploaded bybdsrl
- A Novel Adaptive Algorithm for Removal of Power Line Interference From Ecg SignalUploaded byWaseem Abbas Hashmi
- Definitions of CEC2014 Benchmark Suite Part a(1)Uploaded byjdpatel28
- Fiducial Points Detection Using SvmUploaded byCS & IT
- Optimal-Power-Flow-Report by Debasish Choudhury.pptxUploaded byDebabrata
- 73-220-Lecture03Uploaded byapi-26315128
- Meagher DdUploaded byAbidani Muratna
- S.8 Nelson, R. & Winter, S. _1977_. in Search of a Useful Theory of Innovation. Pág 36-76Uploaded byWILLIAM rOCHA
- HFSS tutorial4Uploaded byamit261287
- group5Uploaded byc0ldlimit8345
- pct_AUploaded byMihaela Voican
- Unit 2 Lecturer Notes of Linear Programming of or by DrUploaded bySharath Chandra
- A Novel Approach.pdfUploaded bysudhialamanda