Related Posts

---

Q. Simple linear programming problem with ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ variables can be easily solved by the graphical method.

Q. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ may be defined as a method of determining an optimum programme inter dependent activities in view of available resources

Q. An optimal solution is the ‐‐‐‐‐‐‐‐‐‐‐ stage of a solution obtained by improving the initial solution

Q. Any solution to a LPP which satisfies the non‐ negativity restrictions of the LPP is called its ‐‐‐‐‐‐‐‐

Q. Any column or raw of a simplex table is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐

Q. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ are called mathematical models

Q. In ‐‐‐‐‐‐‐‐‐‐ models one set of properties is used to represent another set of properties

Q. In simplex method, if there is tie between a decision variable and a slack (or surplus) variable, ‐‐‐ ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ should be selected

Q. A ‐‐‐‐‐‐‐‐‐ has rows / column having non‐ basic cells for holding compensating (+ )or (‐) sign.

Q. For solving an assignment problem, which method is used?