📘 operations research

1. **Problem Statement:** Find the initial basic feasible solution (IBFS) using Vogel's Approximation Method (VAM) and then find the optimum solution for the transportation problem

1. The problem asks about the meaning of a negative $Z_j - C_j$ value in a simplex table during a maximization problem. 2. In the simplex method, $Z_j$ represents the total contrib

1. **State the problem:** We need to forecast this week's production for Monday to Friday using two methods: (i) 4-week simple moving averages and (ii) weighted moving averages wit

1. **State the problem:** We are given a transportation problem with factories F1, F2, F3 supplying units to warehouses W1, W2, W3, W4. The costs per unit and supplies/demands are

1. **State the problem:** We want to maximize the contribution from products I and II given machine hour constraints.

1. **State the problem:** We have a job shop with inter-arrival times distributed as given and processing times normally distributed with mean 50 min, std dev 8 min. We simulate pr

1. **Problem statement:** Assign four technicians (T1–T4) to four machines (M1–M4) to minimize total repair time using the Hungarian Method.

1. **Stating the problem:** We want to allocate the number of groups $L$, $C$, and $P$ (lectures, classes, practicals) to maximize appreciation while not exceeding a budget of 95 m

1. **Problem Statement (QUESTION ONE)**: A petroleum company operates two refineries. We want to formulate and solve its operating cost minimization problem subject to meeting oil

1. Problem 3: Ford Corporation motor supply optimization. - Given production capacities for plants: Boston(50), Dallas(70), Los Angeles(60), St. Paul(80), Denver(100), Atlanta(100)

1. **Problem Statement:** We are given:

1. **State the problem:** Find the number of book gambar ($x$) and book tulis ($y$) to maximize profit given resource constraints.

1. **State the problem:** We want to maximize $w = -2x_1 + 5x_2$ subject to:

1. **Problem Statement:** We have monthly demand data for May to September and need to forecast demand for October, November, and December using three methods: 5-month Moving Avera

1. **State the problem:** We need to maximize total profit from four furniture types with given constraints using the simplex method. 2. **Define variables:**

1. **Problem Statement:** We want to maximize profit from manufacturing components A, B, and C given labor-hour constraints. 2. **Define Variables:** Let $x$, $y$, and $z$ be the n