A feasible solution to a Linear Programming problem must satisfy: (a) all the co

Question

A feasible solution to a Linear Programming problem must satisfy: (a) all the constraints and non-negative restrictions (b) only less-than-or-equal-to type constraints (c) only greater-than-or-equal-to type constraints (d) only equal-to-type constraints (c) only the non-negative restrictions When there is only one optional solution to a Linear Programming problem. The optimal solution must be a corner-point of the feasible region. (a) True (B) False Consider the following transportation Problem. A solution is given. Also, for every empty cell except the cell (3, A), the Cost Reduction Index already calculated. Answer the following questions. The CRI for the cell (3, A) is: (a) 2 (b) 3 (c) 4 (d) 5 (e) 6 The total transportation cost based on the current solution is: (a) 150 (b) 485 (c) 435 (d) 460 (e) 300 If the Cost Reduction Index (i.e.. Reduced Cost) of even one empty cell is concluded that the current solution is not optimal. (a) True (b) False If the current solution is not optimal, you need to find a loop (stepping- solution or allocation that is cheaper than the current shipping plan empty cell with a negative Cost Reduction Index, you can find only on path) starting and ending at the selected empty cell that can lead to a shipping plan, (a) True (b) False How many units should we ship from Source 2 to Destination total transportation cost? (a) 10 (b) 15 (c) 40 (d) 45

Explanation / Answer

14 anwer

........... option B

ALL THE CONSTRAINTS AND NON NEGATIVE RESTRICTIONS

15 answer

.............. its a TRUE

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.