Consider the following linear programming problem:
Maximize 12X + 10Y
Subject to:
4X + 3Y ch7 <= 480
2X + 3Y ch7 <= 360
all variables >= 0
Which of the following points (X,Y) could be a feasible corner point?

Related MCQs

• In linear programming problem if all constraints are less than or equal to, then the feasible region is
• A feasible solution to a linear programming problem
• A solution that satisfies all the constraints of a linear programming problem except the nonnegativity constraints is called
• Which of the following does not represent a factor a manager might consider when employing linear programming for a production scheduling?
• Which of the following is a valid objective function for a linear programming problem?
• Which of the following is not true regarding the linear programming formulation of a transportation problem?
• A type of linear programming problem that is used in marketing is called the
• To find the optimal solution to a linear programming problem using the graphical method
• In the general linear programming model of the assignment problem,
• Most of the constraints in the linear programming problem are expressed as ……….