WorksheetsMansci (midterm question)
Total questions: 51
Worksheet time: 26mins
What is the primary objective of linear programming?
Maximize profits
Minimize costs
Optimize resources
Optimize resources
In linear programming, what is a constraint?
A variable that needs to be optimized
An objective function
A limitation on the values of decision variables
A solution to the problem
Which of the following represents a linear programming problem?
Maximize \(x^2 + y^2\) subject to \(x + y = 1\)
Minimize \(xy\) subject to \(x^2 + y^2 = 1\)
Maximize \(3x + 2y\) subject to \(2x + 3y \leq 10\)
Minimize \(x^2 + y^2\) subject to \(x + y \geq 1\)
What is the graphical method used for in linear programming?
Solving complex problems
Identifying feasible regions
Finding optimal solutions
All of the above
What is the feasible region in linear programming?
The set of all possible solutions
The area that satisfies all constraints
The region with the highest profit
The set of optimal solutions
Which of the following is a property of the objective function in linear programming?
It must be nonlinear
It must be quadratic
It must be linear
It must be a constant
What is the purpose of the simplex method in linear programming?
To solve quadratic equations
To find optimal solutions efficiently
To plot graphs of linear functions
To minimize the number of decision variables
Which of the following statements about constraints in linear programming is true?
Constraints define the objective function
Constraints cannot be inequalities
Constraints restrict the values of decision variables
Constraints are not necessary in linear programming
What does the term "non-negativity constraint" mean in linear programming?
all decision variables must be non-negative
All constraints must be non-negative
The objective function must be non-negative
Non-negativity is not a constraint in linear programming
Which of the following is NOT a phase of the simplex method?
Initialization phase
Feasibility phase
Optimality phase
Solution phase
What is the dual problem in linear programming?
A problem derived from the original problem with constraints and objective functions interchanged
A problem with only one constraint
A problem that is twice as difficult
A problem with no constraints
What is the significance of the shadow price in linear programming?
It represents the additional profit from an extra unit of a resource
It represents the cost of violating a constraint
It represents the slope of the objective function
It represents the number of decision variables
What is the purpose of sensitivity analysis in linear programming?
To analyze the impact of changes in the objective function coefficients and constraint constants on the optimal solution
To determine the feasibility of the problem
To find alternate optimal solutions
To determine the number of decision variables
Which of the following is a limitation of the graphical method in linear programming?
It cannot handle non-linear constraints
It cannot handle more than two decision variables
It cannot handle inequalities
It cannot handle unbounded feasible regions
What is the significance of the pivot element in the simplex method?**
It represents the optimal solution
It is used to update the objective function coefficients
It is used to select the entering and leaving variables
It represents the number of decision variables
What does the term "degeneracy" refer to in linear programming?
A situation where the objective function is non-linear
A situation where there are more constraints than decision variables
A situation where the solution is not optimal
A situation where the number of basic variables is less than the number of constraints
What is the significance of the "slack variables" in linear programming?
They represent the amount of additional profit
They represent the amount of resources used
They represent the surplus or unused resources
They represent the number of decision variables
What is the role of the objective function in linear programming?
To maximize profits
To determine the feasibility of the problem
To define the constraints
To express the goal of the optimization problem
What is the significance of the "optimal solution" in linear programming?
It represents the highest profit
It represents the best feasible solution given the constraints
It represents the minimum cost
It represents the maximum number of decision variables
What does the term "feasible solution" mean in linear programming?
It is the solution that maximizes profits
It is the solution that minimizes costs
It is a solution that satisfies all constraints
It is the solution with the highest objective function value
What is the primary objective of the assignment model?
Minimize transportation costs
Maximize profits
Minimize the total cost or time of completing a set of tasks
Maximize resource allocation
In the assignment model, what does each row represent in the cost matrix?
Tasks
Resources
Costs
Time
What does the Hungarian method solve for in the assignment model?
Maximizing profit
Minimizing transportation costs
Finding the optimal assignment of tasks to resources
Finding the optimal assignment of tasks to resources
The assignment problem is a special case of which more general optimization problem?
Transportation problem
Linear programming problem
Traveling salesman problem
Knapsack problem
Which of the following algorithms is commonly used to solve the assignment problem efficiently?
Dijkstra's algorithm
Bellman-Ford algorithm
Hungarian algorithm
Prim's algorithm
In the assignment model, what does each column represent in the cost matrix?
Tasks
Resources
Costs
Time
Which of the following statements about the assignment model is true?
It allows for fractional assignments of tasks to resources
It requires all tasks to be assigned to exactly one resource.
It is primarily used in resource allocation problems.
It does not consider costs or time constraints.
Which of the following techniques can be used to handle unbalanced assignments in the assignment model?
Adding dummy tasks or resources
Adjusting the costs in the cost matrix
Ignoring the unbalanced assignments
Applying a different optimization algorithm
What is the significance of the "unique assignment" constraint in the assignment model?
It ensures that each task is assigned to exactly one resource.
It allows for multiple assignments of tasks to resources.
It minimizes the total cost of assignments.
It maximizes resource utilization
Which of the following best describes the objective function in the assignment model?
It aims to maximize resource allocation.
It aims to minimize the total cost or time of completing a set of tasks.
it aims to maximize profit.
It aims to minimize transportation costs.
What is the term used to describe a situation where the total supply equals the total demand in the assignment model?
Balanced assignments
Feasible assignments
Unbalanced assignments
Optimal assignments
What does the term "assignment" refer to in the assignment model?
The process of matching tasks to resources
The cost associated with each task
The capacity of each resource
The time required to complete each task
What is the main difference between the assignment model and the transportation model?
The assignment model allows for fractional assignments, while the transportation model does not.
The assignment model involves only one resource and one task, while the transportation model involves multiple resources and tasks.
The assignment model focuses on minimizing costs, while the transportation model focuses on maximizing profits.
There is no significant difference between the two models.
Correct answer: b) The assignment model involves only one
What is the significance of the "non-negativity" constraint in the assignment model?
It ensures that the solution lies within the feasible region of the problem.
It allows for fractional assignments of tasks to resources.
It minimizes the total cost of assignments.
It maximizes resource utilization.
What is the significance of the "unique assignment" constraint in the assignment model?
It ensures that each task is assigned to exactly one resource.
It allows for multiple assignments of tasks to resources.
It allows for multiple assignments of tasks to resources.
It maximizes resource utilization
Which of the following algorithms is NOT commonly used to solve the assignment problem efficiently?
Dijkstra's algorithm
Bellman-Ford algorithm
Hungarian algorithm
Auction algorithm
What role do "dummy cells" play in the assignment model?
They represent additional resources or tasks
They help balance supply and demand.
They create loops for optimizing transportation costs.
They are placeholders for unused resources.
What is the significance of the "closed loop" concept in the assignment model
) It helps identify unallocated resources
It represents a loop formed by selecting cells with positive values in the cost matrix.
It prevents degeneracy in the solution
It minimizes the total transportation cost.
What is the objective of the Modified Distribution Method in the assignment model
To maximize resource allocation
To minimize the total cost or time of completing a set of tasks
To handle unbalanced assignments
To find the optimal assignment of tasks to resources
What does the term "opportunity cost" refer to in the context of the assignment model?
The cost of missed opportunities in resource allocation
The cost of unused resources
The potential savings or profit from reallocating resources
The total transportation cost
What is the primary purpose of the Stepping-Stone Method and Modified Distribution Method in transportation problems
To maximize profit
To minimize transportation costs
To allocate resources efficiently
To handle unbalanced assignments
SINO ANG NANLALAMANG SA KAPWA????
JAYCEL
ALLEIY
ANN
In the Stepping-Stone Method, what is a "closed loop" or "circuit"?
A path connecting all suppliers to all destinations
A loop formed by selecting cells with positive values in the cost matrix
A direct route from one supplier to one destination
A loop formed by unallocated resources
What is the objective of the Stepping-Stone Method when finding an optimal solution in a transportation problem?
Minimizing the total transportation cost
Maximizing the number of assignments
Maximizing the number of assignments
Maximizing profit
In the Modified Distribution Method, what is the purpose of calculating the "UV values"?
To identify unallocated resources
To find the minimum transportation cost
To assess the optimality of a solution
To allocate resources to tasks
What does the term "opportunity cost" refer to in the context of the Stepping-Stone Method?
The cost of missed opportunities in resource allocation
The cost of unused resources
The potential savings or profit from reallocating resources
The total transportation cost
Which of the following is a key advantage of the Stepping-Stone Method and Modified Distribution Method
They are only applicable to balanced transportation problems
They can handle unbalanced transportation problems
They are faster than the simplex method
They are limited to small-sized problems
What is the main difference between the Stepping-Stone Method and the Modified Distribution Method
The Stepping-Stone Method is iterative, while the Modified Distribution Method is deterministic.
The Modified Distribution Method focuses on resource allocation, while the Stepping-Stone Method emphasizes cost minimization.
The Stepping-Stone Method is a heuristic, while the Modified Distribution Method is exact.
There is no significant difference between the two methods.
What role do "dummy cells" play in the Stepping-Stone Method?*
They represent additional resources or tasks.
They help balance supply and demand.
They create loops for optimizing transportation costs.
They are placeholders for unused resources.
When is the Stepping-Stone Method often used in solving transportation problems?
When the problem is unbalanced
When the problem is small in scale
When the problem involves a large number of constraints
When the problem has a linear objective function
What is the significance of the "loop-breaking" process in the Stepping-Stone Method?
It helps identify closed loops in the cost matrix.
It facilitates the calculation of UV values.
It prevents degeneracy in the solution.
It optimally allocates resources.
