Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

Linear algebra question: PROJECT: LINEAR PROGRAMMING n. Linea r programming is c

ID: 380038 • Letter: L

Question

Linear algebra question:

PROJECT: LINEAR PROGRAMMING n. Linea r programming is concerned with maximizing or General Informatio a certain quantity (like cost) whose variables are constrained by various linear inequalities. Linear programming is applicable to many problems in industry and science. In this project, you'll learn about the simplex method for solving such problems. minimizing Key Words. Max-min problems, Feasible solution/region, Optimal solution, Decision vari- ables, Objective function, Constraints, Simplex method, Standard Form, Slack variables References. Basic books on Operations Research (a branch of applied mathematics which studies these types of problems) are a good place to look for information. Problems 1. Seven patients require blood transfusions. We assume four blood types: A, AB, IB and O. Type AB is called the universal recipient; type O is called the universal donor The blood supply and patient data is as follows: PatientBlood Type Need Type Supply Cost AB A 7 pts AB 6 pts B 4 pts O 5 pts 3 S 2 S 4 S 5 AB The problem is to ensure that each patient receives the required amount of the proper type of blood and to use the existing supply so that the cost of replacement is minimized. Formulate this as a linear programming problem but don't actually solve it. Label the decision variables, objective function, and constraints.

Explanation / Answer

1. LP model formulation

Decision variables:

X11, X12, X15, X17, X22, X27, X32, X33, X36, X37, X41, X42, X43, X44, X45, X46, X47 represent the pts of blood type i given to patient j, where i is the first numeral after X and j is the last numeral of the notation.

i=1 to 4 represent blood types A,AB,B and O in that sequence

j=1 to 7 represent patients from 1 to 7

Objective: Min 1(X11+X12+X15+X17) + 2(X22+X27) + 4(X32+X33+X36+X37) + 5(X41+X42+X43+X44+X45+X46+X47)

Constraints:

X11+X12+X15+X17 <= 7

X22+X27 <= 6

X32+X33+X36+X37 <= 4

X41+X42+X43+X44+X45+X46+X47 <= 5

X11+X41 = 2

X12+X22+X32+X42 = 3

X33+X43 = 1

X44 = 2

X15+X45 = 3

X36+X46 = 2

X17+X27+X37+X47 = 1

Xij >= 0

Hire Me For All Your Tutoring Needs
Integrity-first tutoring: clear explanations, guidance, and feedback.
Drop an Email at
drjack9650@gmail.com
Chat Now And Get Quote