Question: the graph paral... For a constraint having single variable only say X>=3, you will draw a line on the graph parallel to None of the

the graph paral...
For a constraint having single variable only say X>=3, you will draw a line on the graph parallel to
None of the above
Y Axis
X Axis
Pass 45 degree through origin
LINEAR PROGRAMMING & LOGISTICS
MCQS
MARKS : 0.5
Which of the modes of transportation can handle only liquid and gaseous state
Pipeline
Road
Rope
Sea
LINEAR PROGRAMMING & LOGISTICS
MCQS
MARKS : 0.5
In a linear programming, the constraint of manufacturing department is 4X + 3y <= 240, the value of X and Y are found to be 30 and 40 respectively, the slack of manufacturind department will be
70
30
0
40
LINEAR PROGRAMMING & LOGISTICS
MCQS
MARKS : 0.5
The task of integrating various segments to provide a comprehensive service from a single window is called
Networking
Supply Chain Management
Logistics Solutions
LINEAR PROGRAMMING & LOGISTICS
MCQS
MARKS : 0.5
Given objective Minimize Cost =4X + 5y and the constraints are X+ 2Y>=80 ; 3X+ Y >=75 AND X AND Y >=0. The minimum cost comes to be
200
330
221
LINEAR PROGRAMMING & LOGISTICS
MCQS
MARKS : 0.5
The initial cost of pipleline mode is expensive but in the long run, it provides cheaper transportation
TRUE
FALSE
Can't determine
LINEAR PROGRAMMING & LOGISTICS
MCQS
MARKS : 0.5
The fundamental objective of logistics is to provide
Route Optimization
Place Utility
Both A and B
Time Utlity
LINEAR PROGRAMMING & LOGISTICS
MCQS
MARKS : 0.5
Road carries most of the world's cargo in terms of volume.
FALSE
Can't determine
TRUE
LINEAR PROGRAMMING & LOGISTICS
MCQS
MARKS : 0.5
The stock damages which happen during transportation is called
Transit Damage
Manufacturing Damage
All of the above
Handling Damage
LINEAR PROGRAMMING & LOGISTICS
MCQS
MARKS : 0.5
The object is to maximize = 9X + 7Y , Constraints are 2X + Y <= 40 AND X + 3Y <= 30 with X AND Y >= 0, the solution comes out to be X= 18 and Y is unknown. However, both constraints are binding. The value of Y will be
0
2
4
8
LINEAR PROGRAMMING & LOGISTICS
MCQS
MARKS : 0.5
Which one of the following is not a valid linear programming constraint formulation?
None of the above
2X * 3 Y<=20
2X + 3 Y<=20
2X + 3 Y>=20
LINEAR PROGRAMMING & LOGISTICS
MCQS
MARKS : 0.5
Faster shipping is usually more cheaper than slow shipping
FALSE
TRUE
LINEAR PROGRAMMING & LOGISTICS
MCQS
MARKS : 0.5
The most expensive but reliable mode of transportation is
Pipeline
Sea
Railway
Air
LINEAR PROGRAMMING & LOGISTICS
MCQS
MARKS : 0.5
In choosing the mode of transportations , which factor / factors to consider
Time
Cost
All of the above
Condition
LINEAR PROGRAMMING & LOGISTICS
MCQS
MARKS : 0.5
If the slack value comes out to be positive for a constraint, it means resources are
short
Not fully utilized
Can't determine
LINEAR PROGRAMMING & LOGISTICS
MCQS
MARKS : 0.5
Which one is not the driver of logistics?
Inventory
Warehousing
All of the above
Procurement
LINEAR PROGRAMMING & LOGISTICS
MCQS
MARKS : 0.5
The major decisions in warehousing are
Layout
Location
Number of warehouses
ownership
All of the above
LINEAR PROGRAMMING & LOGISTICS
MCQS
MARKS : 0.5
Given the constraints X1>=20 , X2>=35 and X1 + X2 >=55, the possible feasible region will be bounded
Can't determine
Inward
Outward
LINEAR PROGRAMMING & LOGISTICS
MCQS
MARKS : 0.5
The presence of restrictions, that limits the degree to which we can pursue our objective in Linear Programming is called
All of the above
Optimal Points
Constraints
Feasible Region
LINEAR PROGRAMMING & LOGISTICS
MCQS
MARKS : 0.5
The optimal solution of linear programming model can never be
Zero
Positive
None of the above
Negative

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!