📊 Management Science
Q. A feasible solution to a linear programming problem
  • (A) must satisfy all problem constraints simultaneously
  • (B) need not satisfy all constraints
  • (C) must be a corner point of the feasible region
  • (D) must optimize the value of the objective function
💬 Discuss
✅ Correct Answer: (A) must satisfy all problem constraints simultaneously

You must be Logged in to update hint/solution

💬 Discussion

Related Posts

Q. Which of the following is not a category of linear programming problems?

Q. Non-negativity constraints are written as ......................

Q. The graphical method of LP problem uses

Q. ......................... is activity oriented network diagram.

Q. Which of the following is not a part of decision tree problem specification?

Q. Constraint in LP problem are called active if they

Q. ............................is known as father of game theory.

Q. …….is the disconnection of an activity before the completion of activities in a project network diagram.

Q. A constraint in an LP model restricts

Q. Decision variables are

📱 Download Our App

Learn MCQs on the go with our easy-to-use Android app

Get it on Google Play

📊 Question Analytics

👁️
668
Total Visits
📽️
2 y ago
Published
🎖️
Rakesh Kumar
Publisher
📈
94%
Success Rate