In LPP the condition to be satisfied is

A. . Constraints have to be linear

B. Objective function have to be linear

.In graphical method the LPP has unbounded solution if the solution space has

no boundary in the first quadrant

Unbounded solution in an LPP is .

where the objective function can be increased or decreased indefinitely.

where the objective function can be decreased indefinitely.

which maximizes the objective function.

where the objective function can be increased indefinitely.

.The objective of network analysis is to .

Minimize total project duration

Minimize product delays,interruption and conflicts

The two forms of LPP are .

standard form and canonical form.

standard form and general form.

matrix form and canonical form.

A feasible solution of LPP

A. Must satisfy all the constraints simultaneously

B. Need not satisfy all the constraints, only some of them

C. Must be a corner point of the feasible region

In North West corner rule if the demand in the column is satisfied one must move to the .

C. right cell in the next column.

A. left cell in the next column.

In North West corner rule if the supply in the row is satisfied one must move .

C. right cell in the next column.

In Graphical solution the feasible region is .

A. where all the constraints are satisfied simultaneously.

B. any one constraint is satisfied .

C. only the first constraint is satisfie

D. any one of the above condition.

The basic feasible solution to a transportation problem is said to be optimal if it .

C. minimizes the transportation cost.

A. maximizes or minimizes the transportation cost.

B. maximizes the transportation cost.

Graphical optimal value for Z can be obtained from

A. . Corner points of feasible region

C. corner points of the solution region

The objective of the transportation problem which is to be maximized is to

C. neither maximize nor minimize.

.Which of the following is not true about feasibility?

it is independent of the objective function

it cannot be determined in a graphical solution of an L.P.P.

it implies that there must be a convex region satisfying all the constraints

extreme points of the convex region gives the optimum solution

Maximization of objective function in LPP means

B. highest value is chosen among allowable decision

A. Value occurs at allowable set decision

Transportation problem is said to be unbalanced if .

A. total supply is not equal to total deman

B. Total supply is greater than total deman

C. total supply is lesser than total deman

Suppose Mizan Tepi university requires 10, 12, and 12 units chemicals A, B, C respectively to decorate mathematics Lab class. A liquid product contains 5,2 and 1 units of A,B and C respectively per Jar. A dry product contains 1,2 and 4 units of A,B,C per carton. If the liquid product sells for Rs. 3 per jar and the Dry product sells Rs.2 per carton, how many of each should be purchased, in order to minimize the cost and requirements?

Mizan Tepi university should purchase 2 jars of liquid product and 2 cartons of dry product then total cost will be Rs. 10.

Mizan Tepi university should purchase 2 jars of liquid product and 25 cartons of dry product then total cost will be Rs. 10.

Mizan Tepi university should purchase 21 jars of liquid product and 12 cartons of dry product,then total cost will be Rs.

Mizan Tepi university should purchase 3 jars of liquid product and 2 cartons of dry product, then total cost will be Rs. 30.

The assignment problem is said to be balanced if .

C. number of rows is equal to number of columns.

A. number of rows is greater than number of columns.

B. number of rows is lesser than number of columns.

D. if the entry of row is zero.

Optimal solution in an LPP is .

which maximizes or minimizes the objective function.

which maximizes the objective function.

which minimizes the objective function.

which satisfies the non negativity restrictions.

Linear Optimization Mock Exam

Authored by Walle Tilahun

Mathematics

University

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

Content View

Student View

78 questions

Show all answers

OPEN ENDED QUESTION

3 mins • 1 pt

In the canonical form of LPP if the objective function is of maximization, then allthe constraints other than non-negativity conditions are .

Evaluate responses using AI:

OFF

OPEN ENDED QUESTION

3 mins • 1 pt

In the canonical form of LPP if the objective function is of minimization then all the constraints other than non-negativity conditions are .

Evaluate responses using AI:

OFF

OPEN ENDED QUESTION

3 mins • 1 pt

.In the standard form of LPP if the objective functions is of minimization then all the constraints .

Evaluate responses using AI:

OFF

OPEN ENDED QUESTION

3 mins • 1 pt

.The non-negative variable which is added to LHS of the constraint to convert the inequality ¡ into equation is called .

Evaluate responses using AI:

OFF

OPEN ENDED QUESTION

3 mins • 1 pt

The non-negative variable which is added to LHS of the constraint to convert the inequality ¿ into equation is called .

Evaluate responses using AI:

OFF

OPEN ENDED QUESTION

3 mins • 1 pt

Every LPP is associated with another LPP is called

Evaluate responses using AI:

OFF

OPEN ENDED QUESTION

3 mins • 1 pt

is another method to solve a given LPP involving some artificial variable?

Evaluate responses using AI:

OFF

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Continue with Google

Continue with Email

Continue with Microsoft

or continue with

Facebook

Apple

Others

Already have an account?

Similar Resources on Wayground

82 questions

Understanding Strings in Python

Quiz

•

University

81 questions

Engman part2

Quiz

•

University

73 questions

Virtual Machine (VM) Quiz

Quiz

•

University

80 questions

untitled

Quiz

•

5th Grade - University

77 questions

Quiz

•

7th Grade - University

76 questions

Place value and rounding

Quiz

•

7th Grade - University

Popular Resources on Wayground

10 questions

HCS SCI 03 Summer School Assessment 1

Quiz

•

3rd Grade

15 questions

HCS SCI 05 Summer School Assessment 1 Review

Quiz

•

5th Grade

22 questions

Day 9 Equations and Inequalities Review

Quiz

•

9th Grade

10 questions

Writing and Identifying Ratios Practice

Quiz

•

5th - 6th Grade

7 questions

PYRAMID PERSPECTIVES part 1

Presentation

•

9th - 12th Grade

12 questions

Understanding the Fourth of July

Quiz

•

9th Grade

15 questions

Soccer World Cup Quiz Questions

Quiz

•

7th Grade

Linear Optimization Mock Exam

In the canonical form of LPP if the objective function is of maximization, then allthe constraints other than non-negativity conditions are .

In the canonical form of LPP if the objective function is of minimization then all the constraints other than non-negativity conditions are .

.In the standard form of LPP if the objective functions is of minimization then all the constraints .

.The non-negative variable which is added to LHS of the constraint to convert the inequality ¡ into equation is called .

The non-negative variable which is added to LHS of the constraint to convert the inequality ¿ into equation is called .

Every LPP is associated with another LPP is called

is another method to solve a given LPP involving some artificial variable?

Suppose the following2x2game be given,then What will be the value of game?

Consider the following linear programming problem:performe it untill we getc j −z j ≤0 MaximizeZ= 3x 1 + 5x 2 + 4x 3 Subject to: 2x 1 + 3x 2 ≤8, 2x 1 + 3x 3 ≤10 3x 1 + 2x 2 + 4x 3 ≤15 x, y≥0 then,What is a basic solution in this problem?

Consider the following linear programming problem:performe it untill we getc j −z j ≥0 MinimizeZ=−3x 1 −9x 2 Subject to: 2x 1 +x 2 ≤40, x 1 + 2x 2 ≤8 x 1, x 2 ≥0 then,What is a basic solution in this problem?

Access all questions and much more by creating a free account

Similar Resources on Wayground

Popular Resources on Wayground