Which of the following conditions ensures that only better solutions will be encountered in the simplex method? (a) Condition of Feasibility (b) Condition of Non-negativity (c) Condition of Optimality (d) Condition of Additivity

(c) Condition of Optimality

Fill in the blank: The method used for optimization when decision variables exceed two is called ______.

Simplex method

True or False: In a linear programming problem, if a resource is not fully utilized, the shadow price of that resource is positive.

False. The shadow price is zero if a resource is not fully utilized.

What is the primary objective of a linear programming problem?

To optimize limited resources

Riddle: I am a method that introduces artificial variables into a problem to solve inequalities, yet I must ensure they don't appear in the final solution. What am I?

Big M method

In the simplex method, a unique solution occurs when the number of basic variables is equal to what?

The number of constraints

Fill in the blank: The dual problem in linear programming is formulated from parameters of the ______ problem.

Primal

Which case in linear programming indicates that the highest value of the objective function can go to infinity?

Unbounded solution

True or False: The graphical method can be used effectively for linear programming problems involving more than two decision variables.

False. The graphical method becomes inadequate when there are more than two decision variables.

What is the maximum possible profit per day if the constraints yield a solution of (20, 10) in a linear programming problem with profit coefficients of 150 and 100?

Rs 4000