0% found this document useful (0 votes)
45 views

Mathematics-Optional: by Venkanna Sir and Satya Sir

This document provides past year questions from 2013-2019 for the UPSC Mathematics optional exam. It includes questions on topics like linear programming, transportation problem, assignment problem, graphical method, and simplex method. Multiple choice questions with their respective values are provided under each year. Sample questions seek to maximize or minimize objective functions subject to various constraints, and require the use of techniques like graphical method, Vogel's approximation method, and simplex method to solve.

Uploaded by

Orlin
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
0% found this document useful (0 votes)
45 views

Mathematics-Optional: by Venkanna Sir and Satya Sir

This document provides past year questions from 2013-2019 for the UPSC Mathematics optional exam. It includes questions on topics like linear programming, transportation problem, assignment problem, graphical method, and simplex method. Multiple choice questions with their respective values are provided under each year. Sample questions seek to maximize or minimize objective functions subject to various constraints, and require the use of techniques like graphical method, Vogel's approximation method, and simplex method to solve.

Uploaded by

Orlin
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/ 8

INDIANCIVILS.

COM

Mathematics-Optional
By Venkanna Sir and Satya Sir

Linear Programming 2013-2019

INDIANCIVILS.COM +91-9000018804
UPSC - MATHEMATICS optional - 2013 Questions
1. M axim ize z = 2 x 1 + 3 x 2 — 5 x 3

Subject to x 1 + x 2 + x 3 = 7

and 2 x 1 — 5 x 2 + x 3 > 1 0, xj > 0 . [10M]

2. Solve the m inim um tim e assignm ent problem: [15M]

M achines

Mi M3 M3 m4
Jobs h 3 12 5 14
h 7 9 8 12

Js 5 11 10 12

u 6 14 4 11

3. M inim ize

subject to the constraints

x x + 2 x 2 — 2 x 3 + 4 x 4 < 40

2 x 1 — x 2 + x 3 + 2x 4 < 8

4 x 1 — 2x 2 + x 3 — x 4 < 1

Xi> 0 [20M]

UPS C - MATHEM ATICS optional - 2014 Questions


1. Solve graphically:
ally:

M axim ize

Subject to 2 x 1 + x 2 < 1 6

+ x 2 < 11

xx + 2 x2 > 6

5xx + 6 x 2 < 90

x 1, x 2 > 0 [10M]

INDIANCIVILS.COM - MATHEMATICS OPTIONAL BY VENKANNA SIR & SATYA SIR Page 1


2. Find the initial basic feasible solution to the following transportation problem by V ogel’s
approxim ation method. Also, find its optimal solution and the m inim um transportation
cost:

[20M]

Destinations
Z>1 d2 D* D4 Supply
Origins Oi 6 4 1 5 14
02 8 9 2 7 16
03 4 3 6 2 5
D em and 6 10 15 4

3. Find all optimal solutions o f the following linear program m ing problem by the simplex
method:

M axim ize

subject to

x 1 < 32

x 2 < 40

xv x2 [20M]

UPSC - MATHEMATIC S optional - 2015 Questions


1. Solve the following assignm ent problem to m axim ize the sales: [10M]

Territories
I II III IV V
A 3 4 5 6 7
Salesmen B 4 15 13 7 6

C 6 13 12 5 11

D 7 12 15 8 5
E 8 13 10 6 9

2 . Consider the following linear program m ing problem:

M axim ize

Subject to

x2 + 2x3 + x4 = 8

x 1 x 2, x 3, x 4 > 0

INDIANCIVILS.COM - MATHEMATICS OPTIONAL BY VENKANNA SIR & SATYA SIR Page 2


(i) U sing the definition, find its all basic solutions. W hich o f these are degenerate basic
feasible solutions and w hich are non-degenerate basic feasible solution?

(ii) W ithout solving the problem, show that it has an optimal solution. W hich of the basic
feasible solution(s) is /are optimal? [20M]

3. Solve the following linear program m ing problem by the simplex method. W rite its dual.
Also, w rite the optimal solution of the dual from the optimal table of the given problem :

M axim ize

Subject to

— x 1 + 2 x 2 + 3 x 3 < 1

x i, x 2 , x 3 > 0 [20M]

UPSC - MATHEMATICS optional - 2016 Questions

a>*
1 . Find the maxim um value of w ith constraints

x + 2y > 1, 2 x + y < 1, x > 0 an.d


n d yy >> 00by
by graphical
graph al method.
method. [10M]

2. M axim ize z = 2 x 1 + 3 x 2 + 6 x3

Subject to

2x1 + x 2 + x 3 <

3 x 2 + 2x 3 < 6

xx > 0 ,x 2 > 0 , x3 > 0 .

Is the optimal solution unique? Justify your answer. [20M]

UPSC - MATHEMATICS optional - 2017 Questions


1. U sing graphical method, find the maxim um value o f 2 x + y

Subject to 4x + 3 y < 1 2

4x + y < 8

4 x —y < 8

x ,y > 0 . [20M]

INDIANCIVILS.COM - MATHEMATICS OPTIONAL BY VENKANNA SIR & SATYA SIR Page 3


2. Solve the follow ing linear program m ing problem by sim plex m ethod: [20M]

M axim ize

Subject to 2 x 1 + 3x 2 < 8

2x2 + 5 x 3 < 10

3 x x + 2 x 2 + 4 x 3 < 15

xj_,x2 , x 3 > 0 .

3. Find the initial basic feasible solution o f the following transportation problem using
V ogel’s approxim ation m ethod and find the cost. [15M]

D estinations
D, d2 D, d4 As
Oi 4 7 0 3 6 14
Origins o ?l 1 2 -3 3 8 9 Supply
O3 3 -1 4 0 5 17
8 3 8 13 8

Dem and

UPSC - MATHEMATICS optional - 2018 Questions


1. An agricultural firm has 180 tons o f nitrogen fertilizer, 250 tons o f phosphate and 220
tons o f potash. It will be able to sell a m ixture o f these substances in their respectively
ration 3 : 3 : 4 at a profit o f Rs. 1500 per ton and a mixture in the ratio 2 : 4:2 at a profit
o f Rs. 1200 per ton. Pose a linear program m ing problem to show how many tons o f these
tw o mixtures should be prepared to obtain the maxim um profit. [10M]

2. Solve the following linear program m ing problem by Big M -m ethod and show that the
problem has finite optimal solutions. A lso find the value o f the objective function:

M axim ize z = 3 xj_ + 5 x 2

Subject to x 1 + 2x2 > 8

3 x 1 + 2 x 2 > 12

5xx + 6x 2 < 60,

x j.,x2 > 0. [20M]

INDIANCIVILS.COM - MATHEMATICS OPTIONAL BY VENKANNA SIR & SATYA SIR Page 4


3. H ow many basic solutions are there in the following linearly independent set o f equations?
Find all o f them.

2xx — x2 + 3x3 + x4 = 6

4 x x — 2 x 2 — x 3 + 2 x 4 = 10. [15M]

4.

M achine
Mi m7 m 3 m 4 Ms
Oi 24 29 18 32 19
17 26 34 2 2

..
0 , 21

03 27 16 28 17 25
04 22 18 28 30 24
Os 28 16 31 24 27
In a factory there are five operators a nd five machines
M]_, M 2 , M 3 ,M 4, M 5. The operating costs are given w hen the 0 £ operator operates the My
m achine( i , j = 1, 2 , ......, 5 ). B ut there is a restriction that 0 3 cannot be allowed to operate the
third m achine M 3 and 0 2 cannot be allowed to operate the fifth machine M 5 .The cost matrix
is given above. Find the optimal assignm ent and the optimal assignm ent cost also. [15M]

UPSC - MATHEMATICS optional - 2019 Questions


1. Use graphical m ethod to solve the linear program m ing problem.

M axim ize

Subject to

x x — x 2 > 1,

x1 + x3 > 3

and [10M]

2. Solve the linear program m ing problem using Simplex method.

M inim ize Z = x x + 2 x 2 — 3 x 3 — 2 x 4

Subject to

x x + 2x 2 — 3x 3 + x4 = 4

x x + 2x 2 + x 3 + 2x 4 = 4

and [15M]

INDIANCIVILS.COM - MATHEMATICS OPTIONAL BY VENKANNA SIR & SATYA SIR Page 5


3. C o n sid er the follow ing LPP,

M axim ize Z = 2 x 1 + 4 x 2 + 4 x 3 — 3 x 4

Subject to

Xi + x 2 + x 3 = 4

x 1 + 4x2 + x4 = 8

and

Use the dual problem to verify that the basic solution (x 1 , x 2 ) is not optimal.

INDIANCIVILS.COM - MATHEMATICS OPTIONAL BY VENKANNA SIR & SATYA SIR Page 6


INDIANCIVILS.COM
A n online IAS A cadem y

ONLINE LIVE COURSES WE OFFER:


1.MATHEMATICS - OPTIONAL
2.TELUGU LITERATURE - OPTIONAL
3.ELECTRICAL ENGINEERING - OPTIONAL

T E S T S E R IE S W E O F F E R :

MATHEMATICS - OPTIONAL

TELUGU LITERATURE - OPTIONAL

ELECTRICAL ENGINEERING - OPTIONAL

Subscribe to our youtube channel: INDIANCIVLS.COM


E -m a il: [email protected]
Phone : +91-9000018804 / 9000018827
Facebook: https://ww.facebook.com/indiancivilsdotcom

You might also like