Reliability and Operations Research
CSIR NET Mathematical Sciences Unit 4: hazard rates, censoring, series and parallel systems, simplex and duality, queues and inventory models.
- 5
- Topics
- 98
- Min read
- 01 Hazard Function, Failure Rates, Censoring and Life TestingStart here CSIR NET statistics: reliability and hazard functions, IFR and DFR classes, Weibull and exponential lives, censoring types, Kaplan-Meier and life-test MLEs.
- 02 Series and Parallel Systems CSIR NET reliability: series, parallel, k-out-of-n, standby and bridge systems; system reliability, MTTF, path and cut bounds and redundancy.
- 03 Linear Programming: Simplex and Duality CSIR NET operations research: LP formulation, basic feasible solutions, the simplex method, Big-M and two-phase, duality theorems and complementary slackness.
- 04 Queuing Models: M/M/1, M/M/c, Limited Waiting Space and M/G/1 CSIR NET queuing theory: birth-death steady state, Little's law, M/M/1, M/M/1/K, M/M/c, M/M/c/K, Erlang formulas and the Pollaczek-Khinchine M/G/1 result.
- 05 Inventory Models: EOQ, Shortages, Production and Newsvendor CSIR NET elementary inventory models: EOQ, planned shortages, finite production rate, quantity discounts, reorder point and the single-period newsvendor.
- Reliability and Operations Research Formula Sheet and Short Notes Revise The whole chapter on one page.
Chapter Overview
This chapter covers the applied end of Unit 4 (statistics) of the CSIR NET Mathematical Sciences syllabus: reliability theory (lifetimes, hazard rates, censored life tests, system reliability) and elementary operations research (linear programming, queues, inventories).
It is a compact, formula-driven chapter, and that makes it a good one to score from. The ideas are few and each comes with a short list of standard results: \( R = e^{-H} \), “total time on test over failures”, “series multiplies successes, parallel multiplies failures”, “most negative enters, smallest ratio leaves”, weak and strong duality, Little’s law, the M/M/1 and M/M/c formulas, Pollaczek-Khinchine, and the square-root EOQ. Part C statements are settled by applying these exactly and checking every option.
The notes assume the probability background of a statistics MSc (exponential, gamma, Weibull and chi-square distributions, Poisson processes, Markov chains) and the linear algebra of any first course. The standard texts for this material include Barlow and Proschan’s Statistical Theory of Reliability and Life Testing, Gross and Harris’ Fundamentals of Queueing Theory, Taha’s Operations Research: An Introduction and Hillier and Lieberman’s Introduction to Operations Research. Every number on these pages was recomputed by program.
What You’ll Learn
By the end of this chapter you will be able to:
- Move between reliability, density, hazard and cumulative hazard; classify lifetimes as IFR, DFR, IFRA, NBU; compute MTTF and mean residual life
- Write the likelihood for Type I, Type II and random censoring, estimate an exponential mean life from a censored test, and build the Kaplan-Meier estimate
- Compute the reliability and MTTF of series, parallel, k-out-of-n, standby and bridge systems, and bound complex systems by minimal paths and cuts
- Solve an LP graphically and by simplex, read a final tableau, handle artificial variables, write the dual and use complementary slackness
- Find steady-state measures for M/M/1, M/M/1/K, M/M/c, M/M/c/K and M/G/1 queues
- Find optimal lot sizes for the EOQ, backorder, production, discount and newsvendor models
Prerequisites
- Probability: conditional probability, independence, standard distributions (see Sample Space, Independence and Bayes)
- Markov chains and stationary distributions (see Markov Chains and Classification of States)
- Linear algebra: rank, bases, solving linear systems (see Linear Algebra)
- Calculus: improper integrals and one- and two-variable optimisation (see Real Analysis)
Learning Path
graph TD
A["1. Hazard Function, Failure Rates, Censoring and Life Testing"] --> B["2. Series and Parallel Systems"]
C["3. Linear Programming: Simplex and Duality"]
A --> D["4. Queuing Models"]
D --> E["5. Inventory Models"]
C --> E
B --> F["Quick Revision"]
E --> FPages 1 and 2 form the reliability half: page 2 builds systems out of the lifetimes of page 1. Page 3 (linear programming) stands on its own and needs only linear algebra. Pages 4 and 5 are the stochastic and deterministic halves of elementary OR models; page 4 reuses the exponential distribution and memorylessness from page 1.
Topics in This Chapter
| Topic | What it covers | Time |
|---|---|---|
| Hazard Function, Failure Rates, Censoring and Life Testing | Reliability and hazard functions, MTTF, mean residual life, Weibull and exponential, bathtub curve, IFR/IFRA/NBU classes, Type I/II and random censoring, total time on test, chi-square intervals, Kaplan-Meier | 40 min |
| Series and Parallel Systems | Structure functions, series, parallel, k-out-of-n, cold standby, series-parallel reduction, bridge network, minimal paths and cuts, bounds, Birnbaum importance, IFR preservation | 35 min |
| Linear Programming: Simplex and Duality | Standard form, BFS and extreme points, graphical method, simplex tableau, Big-M and two-phase, degeneracy, duality theorems, complementary slackness, shadow prices | 45 min |
| Queuing Models | Kendall notation, Little’s law, birth-death steady state, M/M/1, M/M/1/K, M/M/c, M/M/c/K, Erlang B and C, M/G/1 and the Pollaczek-Khinchine formula | 40 min |
| Inventory Models | EOQ, reorder point, planned shortages, finite production rate, quantity discounts, single-period newsvendor | 30 min |
| Quick Revision | Every formula and theorem of the chapter on one page | 10 min |
Official syllabus lines and where they are covered
| Official topic line (Unit 4) | Covered on |
|---|---|
| Hazard function, failure rates, censoring, life testing | Hazard Function, Failure Rates, Censoring and Life Testing |
| Series and parallel systems | Series and Parallel Systems |
| Linear programming: simplex, duality | Linear Programming: Simplex and Duality |
| Queuing (M/M/1, M/M/C with/without limited waiting space, M/G/1) | Queuing Models |
| Inventory models | Inventory Models |
How CSIR NET Asks It
Per the NTA information bulletin for December 2026, the Mathematical Sciences paper (code 704) is marked as follows:
| Part B | Part C | |
|---|---|---|
| Questions given | 40 | 60 |
| Questions to attempt | 25 | 20 |
| Marks per correct answer | 3 | 4.75 |
| Marks per wrong answer | −0.75 | 0 |
| Maximum | 75 | 95 |
NTA publishes no topic-wise weightage, so we make no claim about how many questions come from this chapter. The formats it suits are clear:
- Part B (single correct) rewards one clean computation: a reliability from a hazard, a censored-data MLE, the reliability of a small network, the optimum of a two-variable LP, the dual of an LP, \( W_q \) for an M/M/1 queue, an EOQ. Wrong options are the values from a neighbouring formula (sum of failure times over \( r \), active parallel instead of standby, \( W \) instead of \( W_q \), \( \lambda \) instead of \( \lambda_{\text{eff}} \), maximum inventory instead of lot size).
- Part C (one or more correct) rewards structural facts: “this lifetime is IFR”, “\( 2T/\theta \sim \chi^2_{2r} \)”, “the parallel system is not IFR”, “the dual is infeasible”, “the constraint is slack so its dual price is zero”, “the finite queue is stable for every \( \rho \)”, “allowing shortages lowers the cost”. Every topic page ends with Level 3 practice in exactly this format, with every option justified.
For the marking scheme and the other units, see the Mathematical Sciences overview. Found an error? See About for how to report it.
Start Learning
Begin with the first topic:
→ Hazard Function, Failure Rates, Censoring and Life Testing