BSOP209
Week 5 Homework Assignment
This is a starting point for assisting you in completing Unit 5 assignment. The textbook has several samples for solving this problem. You need to provide all calculations and formulas to receive full credit.
YOU NEED TO CREATE YOUR OWN CHARTS AND RESULTS
BSOP209
Week 5 Homework Assignment B.1 + B.2 plus written assignment
B.1 Maximum Z=XX @ x=XXX and y=XXX (graph below)
B.2 Maximum Z=XX @ x=X and y=X (graph below with a y axis starting at X, because of y>=X constraint)
Feasible corner points (x,y) (XX), (XX), (XX), (XX). Maximum profit 100 at (XX).
Concepts of Linear Programming:
There are two types of linear programming problems discussed, those with 2 decisions variables and those with more than 2 decision variables. The 2 decision variable problems can be solved using the Graphical Solution Method, while the more complex problems require the Simplex Solution Method. Some examples of linear programming being applied in the real world are as follows:
1. Scheduling school buses to minimize the total distance traveled when carrying students.
2. Allocating police patrol units to high crime areas to minimize response time to 911 calls.
3. Scheduling tellers at a bank to ensure customer needs are being met every hour while minimizing the total cost of labor.
4. Picking blends of raw materials in feed mills to produce finished feed combinations at minimum cost.
5. Determining the distribution system that will minimize total shipping costs from several warehouses to various market places.