Consider the following linear programming problem : Maximize \(z = 5x_{1} + 2x_{2} + 3x_{3} - x_{4} + x_{5}\) Subject to : \(x_{1} + 2x_{2} + 2x_{3} + x_{4} = 8\), \(3x_{1} + 4x_{2} + x_{3} + x_{5} = 7\), \(x_{1}, x_{2}, x_{3}, x_{4}, x_{5} \geq 0\) What will be the basic feasible solution after iteration 1 ?
\(x_{1} = 0, x_{2} = 0, x_{3} = 4, x_{4} = 0, x_{5} = 3, z = 15\)
x1 = 0, x2 = 0, x3 = 4, x4 = 0, x5 = 3, z = 15 option is correct.
The simplex method starts from an initial basic feasible solution and, at each iteration, brings the non-basic variable with the most positive reduced cost into the basis. Given the two equality constraints in the problem, the natural starting basis is \(\{x_{4}, x_{5}\}\) because they appear alone in the two rows, yielding the initial values \(x_{4} = 8, x_{5} = 7\) and objective \(z = -x_{4} + x_{5} = -8 + 7 = -1\).
Step 1 — compute the reduced costs \(\bar{c}_{j} = c_{j} - c_{B}^{T} B^{-1} A_{j}\) for each non-basic variable. With \(c_{B} = (-1, 1)^{T}\) these evaluate to \(\bar{c}_{1} = 3, \bar{c}_{2} = 0, \bar{c}_{3} = 4, \bar{c}_{4} = 0, \bar{c}_{5} = 0\). Step 2 — the entering variable is \(x_{3}\) because \(\bar{c}_{3} = 4\) is largest. Step 3 — the minimum-ratio test gives \(8/2 = 4\) in row 1 versus \(7/1 = 7\) in row 2, so \(x_{4}\) leaves. Step 4 — after pivoting, the new basis is \(\{x_{3}, x_{5}\}\) with \(x_{3} = 4, x_{5} = 3\) and objective \(z = 3 \cdot 4 + 1 \cdot 3 = 15\), all other decision variables equal to zero.
The other choices either use a wrong entering variable (leading to smaller objective 12 or 10) or claim infeasibility, which is inconsistent with the presence of a basic feasible starting point.
Let \(\varphi, \psi\) be the formula, \(\varphi \models \Psi\), if and only if \(\varphi \models \Psi\) is a :
Which of the following relations defined on X = {1, 2, 3} is an equivalent relation ?
A rod is divided into six segment is to be colored with one or more of 4 different colors. In how many ways can this be done ?
The thickness of a graph G is defined as minimum number of (edge-disjoint) planar subgraphs into which G can be decomposed. The thickness of G is defined as \(\theta(G)\). What is the thickness of planar graph ?
A committee is to be selected from 5 candidates a, b, c, d and e. The selection must satisfy all the following conditions :
• Either a or b must be included, but not both
• Either c or e or both must be included
• If d is included then b must be included
• Either a or c are included or neither is included.
• If e is included, then c and d must be included. How should selection be made ?
Let us consider the letters from a through h, and all 5 letters are made using these letters. (words are just strings of letters). How many of these words contain no repeated letters ?
Let us consider the following primal problem : Maximize \(z = 2x_{1} + x_{2}\) Subject to \(x_{1} - x_{2} \leq 4\), \(x_{1} - x_{2} \leq 2\), \(x_{1}, x_{2} \geq 0\) What will be its dual problem ?
Identify an appropriate operation sequence with respect to execution of a machine level language instruction.
The “instruction decode” phase in CPU’s instruction cycle is responsible to _____ .
What is the interpretation of \(R_{1} \gets R_{2}\) instruction in Register Transfer Language ?
.................... is a client server application that identifies each host on the internet with a unique user-friendly name.
Every OS has a ................ or .......... which primarily resides in the main memory of the computer to perform some of the basic functions of the OS.
(i) Kernel
(ii) Interface
(iii) Nucleus
(iv) Compiler
Codes:
Which of the following are referred to as low level language?
(i) Machine language
(ii) Assembly language
(iii) High level language
(iv) Natural language
Codes:
Match the following:
| List I | List II |
| (a) New York Public Library | (i) Shelv AR |
| (b) Miami University Augmented Research Group | (ii) Smart library |
| (c) Oula University Library | (iii) Wolf Walk |
| (d) North Carolina State University | (iv) Find the future |
Codes:
Which part of the QR code represents the encoded data?