## Operations Research

121. The transportation problem is balanced, if ______________.

• total demand and total supply are equal and the number of sources equals the number of destinations.
• none of the routes is prohibited
• total demand equals total supply irrespective of the number of sources and destinations
• number of sources matches with number of destinations

122. In an assignment problem involving 5 workers and 5 jobs, total number of assignments possible are ______________.

123. All of the following are assumptions of the EOQ model except ______________

• the usage rate is reasonably constant
• replenishment is not instantaneous
• only one product is involved
• there are no quantity discount price

124. Average number of trains spent in the yard is denoted by ______________.

125. Graphical method of linear programming is useful when the number of decision variable are ______________

126. The cost of a surplus variable is ______________.

127. The dual of the dual is ______________.

• dual-primal
• primal-dual

128. Solution of a Linear Programming Problem when permitted to be infinitely large is called ______________.

• optimum solution
• no solution

129. When the total demand is not equal to supply then it is said to be ______________.

• maximization
• minimization

130. All equality constraints can be replaced equivalently by ______________ inequalities ## Quantitative Techniques: Theory and Problems by

Get full access to Quantitative Techniques: Theory and Problems and 60K+ other titles, with a free 10-day trial of O'Reilly.

There are also live events, courses curated by job role, and more.

## UNBOUNDED SOLUTION

An unbounded solution of a linear programming problem is a situation where objective function is infinite. A linear programming problem is said to have unbounded solution if its solution can be made infinitely large without violating any of its constraints in the problem. Since there is no real applied problem which has infinite return, hence an unbounded solution always represents a problem that has been incorrectly formulated. Under the Simplex Method, an unbounded solution is indicated when there are no positive values of Replacement Ratio i.e. Replacement ratio values are either infinite or negative. In this case there is no outgoing variable.

Get Quantitative Techniques: Theory and Problems now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.

## Don’t leave empty-handed

Get Mark Richards’s Software Architecture Patterns ebook to better understand how to design components—and how they should interact.

## It’s yours, free. ## Check it out now on O’Reilly

Dive in for free with a 10-day trial of the O’Reilly learning platform—then explore all the other resources our members count on to build skills and solve problems every day.  ## If in a LPP the solution of a variable can be... ## If in a LPP , the solution of a variable can be made infinity large without violating the constraints, the solution is _____________.

A. Infeasible

B. Unbounded

C. Alternative

D. None of the above

## Solution(By Examveda Team)

Join the discussion.

Related Questions on Operations Research

The use of decision models.

A. Is possible when the variables value is known

B. Reduces the scope of judgement & intuition known with certainty in decision-making

C. Require the use of computer software

Every mathematical model.

A. Must be deterministic

B. Requires computer aid for its solution

C. Represents data in numerical form

D. All of the above

A physical model is example of.

A. An iconic model

B. An analogue model

C. A verbal model

D. A mathematical model

The qualitative approach to decision analysis relies on.

A. Experience

B. Judgement

C. Intuition

More Related Questions on Operations Research  We're sorry, this computer has been flagged for suspicious activity.

If you are a member, we ask that you confirm your identity by entering in your email.

You will then be sent a link via email to verify your account.

## By Gkseries more articles

Computer based optimization techniques - questions & answers for competitive exams | gkseries.

Free Download as PDF of Computer Based Optimization Techniques Questions with Answers as per exam pattern, to help you in day to day learning. We provide all important questions and answers for all Exam. ## Current Affairs MCQs

State-wise current affairs, general knowledge, month-wise current affairs 2023, category-wise current affairs, jobs by qualification, free mock test.

Document information, original title, available formats, share this document, share or embed document, sharing options.

## Did you find this document useful?

Is this content inappropriate, original title:, reward your curiosity. ## Operations Research

Linear Programming is a mathematical technique used to solve problems of allocating limited resources among the competing activities.

Linear programming is probabilistic in nature.

For an LPP having " n " decision variables, there must be an equal number of constraints.

Variables can be unrestricted in the context of an LPP.

Graphical method of linear programming is not useful when there are only two decision variables.

Objective function specifies the dependent relationship between the decision variables and the objective function.

Optimum solution to an LPP always lies at least on the two vertices of the feasible region.

It is possible for the objective function value of an LPP to be the same at two distinct extreme points.

Solution of maximization LPP when permitted to be infinitely large is called unbounded.

An LPP is said to have feasible solution if it does not satisfy all the constraints of the problem.

An LPP, with all its constraints are of the type ≥, is said to be in standard form.

An LPP, with all its constraints are of the type ≤, is said to be in canonical form.

Exclusion of a redundant constraint does not affect the optimal solution to an LPP.

Slack variables are used to convert the inequalities of the type ≤ into equations.

In maximization LPP, there is no need to introduce artificial variables.

The co-efficients of slack/surplus variables into objective function are

Surplus variables are used to convert the inequalities of the type ≥ into equations.

For solving an LPP by Simplex Method, it is necessary that all unrestricted variables are first replaced by non-negative variables.

In Simplex method, once a variable leaves the basis, it can not reenter the same.

The coefficients of slack/surplus variables are always zero in the objective function.

In Simplex table, if all the elements in the key column are negative, then there is an unbounded solution.

For each of the basic variables in a given solution, whether optimum or not, (z j - c j ) equals zero.

To decide the departing variable in a simplex table giving a non-optimum solution, the least non-negative replacement ratio is selected.

## Find more quizzes from top tags #### IMAGES

1. Linear Programming (Definition, Characteristics, Method & Example) 2. How to Solve a Linear Programming Problem Using the Graphical Method 3. Graphical solution of a linear programming problem. 4. Solved Problem 3-02 (Algorithmic) Consider the following  6. 😎 How to solve linear programming problems graphically. Solving linear programming problems #### VIDEO

1. #1 Formulation of Linear Programming Problem

2. LINEAR PROGRAMMING PROBLEMS (LPP)

3. 3 ऐसे खिलाड़ी अपना आखिरी आईपीएल खेलेंगे #cricket #viral

4. Lecture 18: Replacing a battery with a capacitor to bias a common source amplifier

5. 06 Problems in Linear programming

6. For loop to print digits from one to five #forloops #loops #javaprogramming #java #shorts #ytshorts

1. How Is Linear Programming Used in the Real World?

Linear programming is used daily in the real world to optimize the allocation of resources or activities to generate the most benefit or profit. Linear programming can take multiple factors into account into the thousands and is used extens...

Advantages of linear programming include that it can be used to analyze all different areas of life, it is a good solution for complex problems, it allows for better solution, it unifies disparate areas and it is flexible.

3. What Are Some Solutions to Environmental Problems?

A variety of solutions for environmental problems exist including recycling, reduction of carbon emissions from fossil fuels, finding alternative energy solutions and the conservation of marine life.

4. Operations Research Multiple choice Questions and Answers. Page

128. Solution of a Linear Programming Problem when permitted to be infinitely large is called . unbounded; bounded; optimum solution; no solution. View

5. Unbounded Solution

An unbounded solution of a linear programming problem is a situation where objective function is infinite. A linear programming problem is said to have

6. If in a LPP the solution of a variable can be

An unbounded solution of a linear programming problem is a situation where objective function is infinite. A linear programming problem is said to have

7. OR-BMS-MCQs.pdf

(1) The region of feasible solution in LPP graphical method is called ____. (a) Infeasible region. (b) Unbounded region. (c) Infinite region.

8. In a maximization problem, when one or more of the ...

Under a maximization problem, an unbounded solution is referred to as a solution that can be formed infinitely large by not disobeying any of the

9. In an assignment problem involving 5 workers and 5

A project consists of a number of tasks which are called

10. Computer Based Optimization Techniques

Solution of a Linear Programming Problem when permitted to be infinitely large is called ______. [A] unbounded; [B] bounded; [C] optimum solution

11. MCQ Unit 3

Solution of a Linear Programming Problem when permitted to be infinitely large. is called +AF8AXwBfAF8AXwBfAF8AXwBf-. A. unbounded. B. bounded. C. optimum

12. OPERATIONS RESEARCH Multiple Choice Questions

Solution of a Linear Programming Problem when permitted to be infinitely large is called . A. unbounded. B. bounded. C. optimum solution. D. no solution. View

13. Operations Research Online Test

9. Solution of maximization LPP when permitted to be infinitely large is called unbounded. TRUE. FALSE

14. Mcq operation research

Solution of a Linear Programming Problem when permitted to be infinitely large is called . A. unbounded B. bounded C. optimum solution D. no solution. View