IGNOU MTE-12 Solved Assignment 2023 | MTE Abstract Classes ®

Solved By – Narendra Kr. Sharma – M.Sc (Mathematics Honors) – Delhi University

₹251.00

Share with your Friends

IGNOU MTE-12 Assignment Question Paper 2023

Course Code: MTE-12
Assignment Code: MTE-12/TMA/2023
Maximum Marks: 100

1. Which of the following statements are true and which are false? Give a short proof or a counter-example in support of your answer.

a) In a two-dimensional LPP solution, the objective function can assume the same value at two distinct extreme points.

b) Both the primal and dual of an LPP can be infeasible.

c) An unrestricted primal variable converts into an equality dual constraint.

d) In a two-person zero-sum game, if the optimal solution requires one player to use a pure strategy, the other player must do the same.

e) If 10 is added to each entry of a row in the cost matrix of an assignment problem, then the total cost of an optimal assignment for the changed cost matrix will also increase by 10 .

2. a) Solve the following linear programming problem using simple method:

Maximize $\mathrm{z}=3 \mathrm{x}_{1}+5 \mathrm{x}_{2}+4 \mathrm{x}_{3}$

Subject to $2 \mathrm{x}_{1}+3 \mathrm{x}_{2} \leq 8$

$2 \mathrm{x}_{2}+5 \mathrm{x}_{3} \leq 10$

$3 \mathrm{x}_{1}+2 \mathrm{x}_{2}+4 \mathrm{x}_{3} \leq 15$

$\mathrm{x}_{1}, \mathrm{x}_{2}, \mathrm{x}_{3} \geq 0$

b) Using the principle of dominance, reduce the size of the following game:

\[
\left[\begin{array}{ccc}
-1 & -2 & 8 \\
7 & 5 & -1 \\
6 & 0 & 12
\end{array}\right]
\]

Hence solve the game.

3. a) Find all basic feasible solutions for the following set of equations:

\[
\begin{aligned}
& 2 x_{1}+6 x_{2}+2 x_{3}+x_{4}=3 \\
& 6 x_{1}+4 x_{2}+4 x_{3}+6 x_{4}=2 \\
& x_{1}, x_{2}, x_{3}, x 4 \geq 0
\end{aligned}
\]

b) Examine convexity of the following sets:

i) $\mathrm{S}_{1}=\left\{\left(\mathrm{x}_{1}, \mathrm{x}_{2}\right) \in \mathbb{R}^{2} \mid 4 \mathrm{x}_{1}+3 \mathrm{x}_{2} \leq 6, \mathrm{x}_{1}+\mathrm{x}_{2} \geq 1\right\}$

ii) $\mathrm{S}_{2}=\left\{(\mathrm{x}, \mathrm{y}) \in \mathbb{R}^{2} \mid \mathrm{x}^{2}+\mathrm{y}^{2} \geq 1\right\}$.

4. a) Solve the following linear programming problem by graphical method:

\[
\text { Maximize } \mathrm{z}=5 \mathrm{x}_{1}+7 \mathrm{x}_{2}
\]

Subject to $\quad \mathrm{x}_{1}+\mathrm{x}_{2} \leq 4$

\[
\begin{aligned}
& 3 \mathrm{x}_{1}+8 \mathrm{x}_{2} \leq 24 \\
& 10 \mathrm{x}_{1}+7 \mathrm{x}_{2} \leq 35 \\
& \mathrm{x}_{1}, \mathrm{x}_{2} \geq 0
\end{aligned}
\]

b) Find the dual of the following LPP:

\[
\begin{array}{ll}
\text { Maximize } & z=x_{1}+x_{2}+x_{3} \\
\text { Subject to } & x_{1}-3 x_{2}+4 x_{3}=5 \\
& x_{1}-2 x_{2} \leq 3 \\
& 2 x_{2}-x_{3} \geq 4
\end{array}
\]

$\mathrm{x}_{1}, \mathrm{x}_{2} \geq 0$ and $\mathrm{x}_{3}$ is unrestricted in sign.

5. a) Find the initial basic feasible solution of the following transportation problem using matrix-minima method:

	Destinations			Supply
	I	II	III
A	2	7	4	5
Sources B	3	3	1	8
C	5	4	7	7
D	1	6	2	14
Demand	7	9	18	34

Also, find the optimal solution.

b) Solve the following game graphically:

	Player B
Player A	B1	B2
A1	2	7
A2	3	5
A3	11	2

6. a) A firm manufactures two types of products, A and B, and sells them at a profit of ₹ 2 on type $A$ and $₹ 3$ on type B. Each product is processed on two machines $M_{1}$ and $M_{2}$. Type a requires one minute of processing time on $M_{1}$ and two minutes on $M_{2}$; type $B$ requires one minute on $M_{1}$ and one minute on $M_{2}$. The machine $M_{1}$ is available for not more than 6 hours 40 minutes while machine $M_{2}$ is available for 10 hours during any working day.

Formulate the problem at LPP.

b) Solve the following assignment problem:

I	2	9	2	7	1
II	6	8	7	6	1
III	4	6	5	3	1
IV	4	2	7	3	1
V	5	3	9	5	1

7. a) The following table is obtained in the intermediate state while solving an LPP by simplex method:

30	23	29	0	0
$B$	$CB$	$x1$	$x2$	$x3$	$S1$	$S2$	R.H.S.
$S1$	0	0	2	$-9/2$	1	$-3/2$	$31/2$
$X1$	30	1	$1/2$	$5/4$	0	$1/4$	$7/4$

Check whether an optimal solution of the LPP will exist or not.

b) Write the LPP model of the following transportation problem:

5	7	6	4	70
2	8	3	1	50
1	7	4	5	90
50	40	50	70

c) Find the range of values of $\mathrm{p}$ and $\mathrm{q}$ which will render the entry $(2,2)$, a saddle point for the following game:

Player B
Player A	4	5
10	7	$q$
4	$p$	6

8. a) Test the convexity of the following sets:

\[
\begin{aligned}
& S_{1}=\left\{(x, y) \mid x^{2}+y^{2} \geq 1, y \geq x, y \geq-x\right\} \\
& S_{2}=\left\{(x, y) \mid x^{2}+y^{2} \leq 16, x \leq 2, y \geq 2\right\}
\end{aligned}
\]

b) Determine all the basic feasible solutions to the equations

\[
\begin{aligned}
& x_{1}+x_{2}+2 x_{3}=4 \\
& 2 x_{1}-x_{2}+x_{3}=2 .
\end{aligned}
\]

Identify the degenerate basic feasible solutions.

9. a) Let $A=\left[\begin{array}{lll}2 & 5 & 1 \\ 3 & 2 & 1\end{array}\right], \mathrm{B}=\left[\begin{array}{ll}1 & 2 \\ 3 & 5\end{array}\right]$ and $\mathrm{C}=\left[\begin{array}{ll}1 & 3 \\ 2 & 2 \\ 5 & 1\end{array}\right]$. Compute $\mathrm{AB}, \mathrm{BC}, \mathrm{AC}$, if they exists, otherwise, give reason for their non-existence.

b) Solve the following LPP:

\[
\begin{array}{ll}
\text { Minimize } & \mathrm{z}=\mathrm{x}_{1}-2 \mathrm{x}_{2}-3 \mathrm{x}_{3} \\
\text { Subject to } & -2 \mathrm{x}_{1}+3 x_{2}+3 \mathrm{x}_{3}=2 \\
& 2 \mathrm{x}_{1}+3 \mathrm{x}_{2}+4 \mathrm{x}_{3}=1 \\
& \mathrm{x}_{1}, \mathrm{x}_{2}, \mathrm{x}_{3} \geq 0
\end{array}
\]

c) Find the saddle point (if exists) in the following pay-off matrix:

Player B
Player A	-1	-1	7
3	1	3
6	-1	-3

Also, find the value of the game.

10. a) Determine an initial basic feasible solution to the following transportation problem and hence find an optimal solution to the problem:


$O1$	1	2	3	4	6
$O2$	12	10	5	7	8
$O3$	9	11	8	13	10
	4	6	8	6

b) Find all values of $\mathrm{k}$ for which the vectors $\left[\begin{array}{l}1 \\ 0 \\ 1\end{array}\right],\left[\begin{array}{c}1 \\ -1 \\ 0\end{array}\right]$ and $\left[\begin{array}{c}\mathrm{k} \\ -\mathrm{k} \\ 2\end{array}\right]$ are linearly independent.

MTE-12 Sample Solution 2023

Frequently Asked Questions (FAQs)

How do I access the Complete Solution?

You can access the Complete Solution through our app, which can be downloaded using this link:

App Link

Simply click “Install” to download and install the app, and then follow the instructions to purchase the required assignment solution. Currently, the app is only available for Android devices. We are working on making the app available for iOS in the future, but it is not currently available for iOS devices.

Is this Complete Solution for IGNOU Assignments?

Yes, It is Complete Solution, a comprehensive solution to the assignments for IGNOU. Valid from January 1, 2023 to December 31, 2023.

Is the Complete Solution aligned with the IGNOU requirements?

Yes, the Complete Solution is aligned with the IGNOU requirements and has been solved accordingly.

Is the Complete Solution guaranteed error-free?

Yes, the Complete Solution is guaranteed to be error-free.The solutions are thoroughly researched and verified by subject matter experts to ensure their accuracy.

Can I access the Complete Solution anytime?

As of now, you have access to the Complete Solution for a period of 6 months after the date of purchase, which is sufficient to complete the assignment. However, we can extend the access period upon request. You can access the solution anytime through our app.

What if I need help with a specific assignment question?

The app provides complete solutions for all assignment questions. If you still need help, you can contact the support team for assistance at Whatsapp +91-9958288900

Can I access the educational materials on multiple devices?

No, access to the educational materials is limited to one device only, where you have first logged in. Logging in on multiple devices is not allowed and may result in the revocation of access to the educational materials.

How do I make a payment for accessing the solutions?

Payments can be made through various secure online payment methods available in the app.Your payment information is protected with industry-standard security measures to ensure its confidentiality and safety. You will receive a receipt for your payment through email or within the app, depending on your preference.

What are the instructions for formatting my assignments?

The instructions for formatting your assignments are detailed in the Assignment Booklet, which includes details on paper size, margins, precision, and submission requirements. It is important to strictly follow these instructions to facilitate evaluation and avoid delays.

Terms and Conditions

The educational materials provided in the app are the sole property of the app owner and are protected by copyright laws.
Reproduction, distribution, or sale of the educational materials without prior written consent from the app owner is strictly prohibited and may result in legal consequences.
Any attempt to modify, alter, or use the educational materials for commercial purposes is strictly prohibited.
The app owner reserves the right to revoke access to the educational materials at any time without notice for any violation of these terms and conditions.
The app owner is not responsible for any damages or losses resulting from the use of the educational materials.
The app owner reserves the right to modify these terms and conditions at any time without notice.
By accessing and using the app, you agree to abide by these terms and conditions.
Access to the educational materials is limited to one device only. Logging in to the app on multiple devices is not allowed and may result in the revocation of access to the educational materials.

Our educational materials are solely available on our website and application only. Users and students can report the dealing or selling of the copied version of our educational materials by any third party at our email address (abstract4math@gmail.com) or mobile no. (+91-9958288900).

In return, such users/students can expect free our educational materials/assignments and other benefits as a bonafide gesture which will be completely dependent upon our discretion.