Linear Programming Test

Result

Linear Programming Test - 20

Score
-
out of -
Rank
-
out of -

TIME Taken - -

SHARING IS CARING

If our Website helped you a little, then kindly spread our voice using Social Networks. Spread our word to your readers, friends, teachers, students & all those close ones who deserve to know what you know now.

Weekly Quiz Competition

Question 1
1 / -0

Linear programming used to optimize mathematical procedure and is

A
subset of mathematical programming

B
dimension of mathematical programming

C
linear mathematical programming

D
all of above

Solution

Linear programming is an extremely powerful tool for addressing a wide range of applied optimization problems. A short list of application areas is resource allocation, production scheduling, warehousing, layout, transportation scheduling, facility location, flight crew scheduling, portfolio optimization, parameter estimation.
So ,linear programming is used to subset mathematical programming.
Question 2
1 / -0

A furniture company makes one style of tables and chairs. The chart on the left above gives the prices of these tables and chairs in three different years. The chart on the right gives the maximum number of tables and chairs that can be stocked in each of three ware-houses, $$X, Y$$, and $$Z$$. Based on the prices shown, what was the maximum possible value of the table and chair inventory in warehouse $$Y$$ in 1995 ?

A
$$\$23,950$$

B
$$\$26,500$$

C
$$\$27,200$$

D
$$\$28,400$$

E
$$\$29,500$$

Solution

In $$1995$$,
Price of each table $$=$$ $$ $265$$
Price of each chair $$=$$ $$ $30$$

In warehouse $$'Y'$$,
Maximum Number of tables that can be stocked $$=$$ $$80$$
Maximum Number of chairs that can be stocked $$=$$ $$200$$

Price of $$80$$ tables $$=$$ $$80$$ $$\times$$ Price of each table
$$=$$ $$80$$ $$\times$$ $$ $265$$
$$=$$ $$ $21,200$$
Price of $$200$$ chairs $$=$$ $$200$$ $$\times$$ Price of each chair
$$=$$ $$200$$ $$\times$$ $$ $30$$
$$=$$ $$ $6,000$$

Maximum possible value of the table and chair inventory in $$'Y'$$ in $$1995$$ $$=$$ Price of $$80$$ tables $$+$$ Price of $$200$$ chairs
$$=$$ $$ $21,200$$ $$+$$ $$ $6,000$$
$$=$$ $$ $27,200$$

Therefore, Maximum possible value of the table and chair inventory in $$'Y'$$ in $$1995$$ is $$'27,200'$$.
Question 3
1 / -0

In transportation models designed in linear programming, points of demand is classified as

A
ordination

B
transportation

C
destinations

D
origins

Solution

In linear programming, transportation model are applied to problems related to the study of efficient transportation routes. i.e., how effectively the available resources are transported to different destinations with minimum cost.
Therefore, the points of demand is classified as destinations.
Question 4
1 / -0

Which of the following is a property of all linear programming problems?

A
alternate courses of action to choose from

B
minimization of some objective

C
a computer program

D
usage of graphs in the solution

E
usage of linear and nonlinear equations and inequalities

Solution

According to Robbins, the resources(capital, land, labour, materials, ...) are always limited. Every resource have multiple uses.

The problem before any organisation or manager is to choose the best alternatives which can maximize the profit or minimize the cost of production. Linear programming is the method which is used to select the best possible alternatives from the all alternatives.

According to William M. Fox, "Linear programming is a planning technique that permits some objective function to be maximized or minimized within the framework of given situational restrictions"

Therefore, the linear programming is the process of selecting best courses of action to choose from various alternatives.
Question 5
1 / -0
In graphical solutions of linear inequalities, solution can be divided into
A
one subset

B
two subsets

C
three subsets

D
four subsets

Solution

In graphical solutions of linear inequalities, solution can be divided into two subsets.
for example, $$2x+y\leq 4$$
One subset includes all values (x,y) that satisfy the equation $$2x+y = 4$$
and the other subset includes all the values (x,y) that satisfy $$2x+y < 4$$
Question 6
1 / -0

Linear programming model which involves funds allocation of limited investment is classified as

A
ordination budgeting model

B
capital budgeting models

C
funds investment models

D
funds origin models

Solution

In linear programming, $$\text{Capital budgeting models}$$ to minimize the total capital cost.
The solutions from the model are used to decide the best combination of capital resources and best times to start and finish projects and to determine the net capital cost.
Question 7
1 / -0

In linear programming, objective function and objective constraints are

A
solved

B
linear

C
quadratic

D
adjacent

Solution

In linear programming, objective function and objective constraints are linear.

Any linear programming problem must have the following properties:-
1. The relationship between variables and constraints must be linear.
2. The constraints must be non-negative.
3.. objective function must be linear.
Question 8
1 / -0

In order for a linear programming problem to have a unique solution, the solution must exist

A
at the intersection of the nonnegativity constraints.

B
at the intersection of a nonnegativity constraint and a resource constraint.

C
at the intersection of the objective function and a constraint.

D
at the intersection of two or more constraints.

E
none of the above

Solution

In order for a linear programming problem to have a unique solution, the solution must exist at the intersection of two or more constraints. Then the problem becomes convex and has a single optimum(maximum or minimum) solution.
Question 9
1 / -0

The first step in formulating an LP problem is

A
graph the problem.

B
perform a sensitivity analysis.

C
identify the objective and the constraints.

D
define the decision variables.

E
understand the managerial problem being faced.

Solution

The first step in formulating an linear programming problem is to understand the managerial problem being faced i.e., determine the quantities that are needed to solve the problem.
Question 10
1 / -0

Choose the most correct of the following statements relating to primal-dual linear programming problems:

A
Shadow prices of resources in the primal are optimal values of the dual variables.

B
The optimal values of the objective functions of primal and dual are the same.

C
If the primal problem has unbounded solution, the dual problem would have infeasibility.

D
All of the above.

Solution

From the primal-dual relationship,
The shadow prices of resources in the primal are optimal values of the dual variables.

If one of the problems has an optimal feasible solution then the other problem also has an optimal feasible solution. The optimal objective function value is same for both primal and dual problems.

If one problem has an unbounded solution then the other problem is infeasible.

User

Question Analysis

Correct -
Wrong -
Skipped -

My Perfomance

Score
-
out of -
Rank
-
out of -

Re-Attempt Weekly Quiz Competition

Linear Programming Test - 20

Result

Linear Programming Test - 20

Score

-

Rank

-

SHARING IS CARING

Question 1

subset of mathematical programming

dimension of mathematical programming

linear mathematical programming

all of above

Solution

Question 2

$$\$23,950$$

$$\$26,500$$

$$\$27,200$$

$$\$28,400$$

$$\$29,500$$

Solution

Question 3

ordination

transportation

destinations

origins

Solution

Question 4

alternate courses of action to choose from

minimization of some objective

a computer program

usage of graphs in the solution

usage of linear and nonlinear equations and inequalities

Solution

Question 5

one subset

two subsets

three subsets

four subsets

Solution

Question 6

ordination budgeting model

capital budgeting models

funds investment models

funds origin models

Solution

Question 7

solved

linear

quadratic

adjacent

Solution

Question 8

at the intersection of the nonnegativity constraints.

at the intersection of a nonnegativity constraint and a resource constraint.

at the intersection of the objective function and a constraint.

at the intersection of two or more constraints.

none of the above

Solution

Question 9

graph the problem.

perform a sensitivity analysis.

identify the objective and the constraints.

define the decision variables.

understand the managerial problem being faced.

Solution

Question 10

Shadow prices of resources in the primal are optimal values of the dual variables.

The optimal values of the objective functions of primal and dual are the same.

If the primal problem has unbounded solution, the dual problem would have infeasibility.

All of the above.

Solution

User

Question Analysis

My Perfomance

Score

-

Rank

-

Results Announcement on: coming Monday