LESSON 2: INTRODUCTION TO OPTIMIZATION AND LINEAR PROGRAMMING Flashcards
In a supply chain optimization problem, what is the primary objective?
A. Minimize customer satisfaction
B. Maximize transportation costs
C. Maximize profit
D. Minimize production efficiency
Maximize profit
A manufacturing company wants to maximize its profit while producing two products, Product A and Product B. Which of the following represents a linear objective function for this problem?
A. Maximize 2 * Product A + 3 * Product B
B. Minimize Product A * Product B
C. Maximize Product A + Product B
D. Maximize 2 * Product A - 3 * Product B
Maximize 2 * Product A + 3 * Product B
In linear programming, constraints are typically represented as which among the following?
A. Linear equations
B. Non-linear equations
C. Inequalities
D. Exponential equations
Linear equations
A company can produce a maximum of 1,000 units of a product. Which type of constraint does this represent in linear programming?
A. Equality constraint
B. Resource constraint
C. Surplus constraint
D. Objective constraint
Resource constraint
Which method is used to find the optimal solution in linear programming when dealing with multiple objective functions?
A. Simplex method
B. Dual simplex method
C. Goal programming
D. Branch and bound method
Goal programming
A diet optimization problem aims to minimize costs while meeting daily nutritional requirements. Which type of constraint is this?
A. Equality constraint
B. Resource constraint
C. Surplus constraint
D. Objective constraint
Resource constraint
In a transportation optimization problem, what does the objective function typically seek to optimize?
A. Delivery time
B. Distance traveled
C. Transportation cost
D. Fuel consumption
Transportation cost
A production manager wants to minimize the total production time for a set of products. Which type of linear programming problem is this?
A. Maximization problem
B. Minimization problem
C. Feasibility problem
D. Unbounded problem
Minimization problem
In integer linear programming, when decision variables must take on integer values, it is typically used for what type of problems?
A. Fractional problems
B. Continuous problems
C. Mixed-integer problems
D. Linear problems
Mixed-integer problems
Which type of linear programming problem has an unbounded feasible region?
A. Feasibility problem
B. Maximization problem
C. Minimization problem
D. Infeasibility problem
Minimization problem
When performing sensitivity analysis in linear programming, what does the shadow price represent?
A. The price of shadows
B. The opportunity cost of relaxing a constraint
C. The cost of increasing a variable’s value
D. The cost of changing the objective function
The opportunity cost of relaxing a constraint
Which linear programming method is particularly useful for solving large-scale linear programming problems?
A. Graphical method
B. Simplex method
C. Goal programming
D. Feasibility method
Simplex method
An online retailer wants to maximize its profits from online advertising while adhering to a budget constraint. Which type of linear programming problem is this?
A. Maximization problem
B. Minimization problem
C. Feasibility problem
D. Infeasibility problem
Maximization problem
A farmer wants to maximize the yield of two crops, wheat and corn, with limited resources. What type of linear programming problem is this?
A. Maximization problem
B. Minimization problem
C. Feasibility problem
D. Infeasibility problem
Maximization problem
In a network optimization problem, what are nodes and arcs typically used to represent?
A. Employees and managers
B. Warehouse locations and transportation routes
C. Financial assets and liabilities
D. Sales and marketing strategies
Warehouse locations and transportation routes