Linear Programming Assignment Help

Assignment-1 MATH 341 (Summer 2…

PDF

Linear Programming Applications.p…

PDF

i have attached assignment 1 which contains 5 questions.

you have to attempt all 5. formulate linear programs for all
the qs. i have also attached the other pdf named linear
programming aplications for reference, you can see the
format from there. use proper format, first assign decision
variables, then the objective functions, then the constraints
and in the end the non negative constraints. also explain all
solutions and every question and each step and in the end
just give answers alone as well.

Thanks for sharing both PDFs. Before I start formulating and explaining the linear programs
for each of the five questions, could you please confirm:

1. Do you want the solutions in a Word document or should I display them here directly for
copy-pasting?

2. Should the answers at the end be given in a bullet list or in a table format?

3. Do you want me to follow the exact formatting (fonts, structure) from the reference PDF
or just the structure (decision variables, objective function, constraints, etc.)?

Let me know so I can proceed accordingly!

1. text form for copy pasting

2. bullet
3. just the structure

Great! I’ll now formulate and explain all five linear programming problems from your
assignment using the required structure: defining decision variables, objective function,
constraints, and non-negativity conditions. Each problem will include a clear explanation of
steps, and the final answers will be summarized in bullet points at the end.

I'll get started and update you once everything is ready.

1/22
 Linear Programming Formulations for Assignment 1 (MATH 341)

Linear Programming Model

Formulations (Assignment 1)
Question 1 (Spandex Knifelifter)
Decision variables: Let Fm , Fp = number of frames manufactured and purchased; Sm , Sp
​ ​ ​ ​

= number of supports manufactured and purchased; Tm , Tp = number of straps ​ ​

manufactured and purchased. (Motors are all purchased, so no decision variable for
motors or treat them as fixed demand of 5000.)

Objective function: Minimize total cost:

min Z = 38Fm + 51Fp + 11.50Sm + 15Sp + 6.50Tm + 9.50Tp .
​ ​ ​ ​ ​ ​

Constraints:

Demand: Fm ​ + Fp = 5000 (frames), Sm + Sp = 5000 (supports), Tm + Tp = 5000

​ ​ ​ ​ ​

(straps).

Capacity (convert hours to minutes, 1 hr = 60 min):

3.5Fm + 1.3Sm + 0.8Tm ≤ 350 × 60 (Cutting),
​ ​ ​

2.2Fm + 1.7Sm + 0 ⋅ Tm ≤ 420 × 60 (Milling),

​ ​ ​

3.1Fm + 2.6Sm + 2.5Tm ≤ 570 × 60 (Shaping).

​ ​ ​

Purchase satisfies production (implicitly done by demand constraints).

Non-negativity: Fm , Fp , Sm , Sp , Tm , Tp
​ ​ ​ ​ ​ ​ ≥ 0.

In this formulation, each decision variable represents how many of each component are
produced internally versus bought. The objective is to minimize cost of manufacturing or
purchasing all required components gurobi.com . The demand constraints ensure exactly 5000
of each component are available for the 5000 Knifelifter units. The capacity constraints on
cutting, milling, and shaping are linear inequalities reflecting available machine time
(converted to minutes). All variables are continuous and nonnegative, consistent with
standard LP form ocw.mit.edu gurobi.com .

Question 2 (Hilltop Coffee Blending)

2/22
 Decision variables: Let x1 , x2 , x3 be the number of pounds of coffee beans 1, 2, and 3 in
​ ​ ​

the blend. (Assume a fixed total output; for example, x1 ​ + x2 + x3 = 1000 lbs.)
​ ​

Objective function: Minimize cost:

min Z = 0.50x1 + 0.70x2 + 0.45x3 .
​ ​ ​

Constraints:

Aroma quality (weighted average ≥ 75):

75x1 + 85x2 + 60x3 ≥ 75(x1 + x2 + x3 ).
​ ​ ​ ​ ​

(Equivalently 75x1 + 85x2 + 60x3 ≥ 75 × 1000 if total = 1000.)

​ ​ ​

Taste quality (weighted average ≥ 80):

86x1 + 88x2 + 75x3 ≥ 80(x1 + x2 + x3 ).
​ ​ ​ ​ ​

Supply limits: x1 ​ ≤ 500, x2 ≤ 600, x3 ≤ 400. ​ ​

Total output: x1 ​ + x2 + x3 = 1000 (pounds of blended coffee).

​ ​

Non-negativity: x1 , x2 , x3​ ​ ​ ≥ 0.

This LP chooses how many pounds of each bean to blend to minimize cost while meeting
quality standards gurobi.com . The aroma and taste constraints enforce that the weighted
average ratings meet the required levels (as assumed in the problem cengage.com ). We also
include supply constraints so we do not exceed available pounds of each bean. The decision
variables are continuous, representing quantities of each bean used. This fits the standard
LP structure of a linear objective with linear constraints ocw.mit.edu gurobi.com .

Question 3 (SOB Restaurant Scheduling)

Decision variables: Let x = number of full-time employees in the 11 AM shift, and y =
number in the 1 PM shift. Let P11 , P12 , … , P9−10 = number of part-time employees
​ ​ ​

working in each one-hour slot (the 11–12 slot, 12–1 slot, …, 9–10 slot).

Objective function: Minimize daily labor cost:

min Z = 110x + 110y + 7.60 ∑ Pslot . ​ ​

slots
(Each full-time costs $110 per day, each part-time $7.60 per hour.)

Constraints:

Service requirements each hour: for each time slot, Fslot ​

+ Pslot ≥ Requiredslot ,
​ ​

where Fslot is the number of full-timers on duty in that slot. Based on their shifts:
​

11–12: F11−12 ​
= x, require x + P11−12 ≥ 9. ​

3/22
 12–1: F12−1 ​ = x, require x + P12−1 ≥ 12. ​

1–2: F1−2 = x + y, require x + y + P1−2 ≥ 8. ​

2–3: F2−3 = x + y, require x + y + P2−3 ≥ 3. ​

3–4: F3−4 = y, require y + P3−4 ≥ 5. ​

4–5: F4−5 = x + y, require x + y + P4−5 ≥ 4. ​

5–6: F5−6 = x, require x + P5−6 ≥ 6. ​

6–7: F6−7 = x + y, require x + y + P6−7 ≥ 15. ​

7–8: F7−8 = x + y, require x + y + P7−8 ≥ 13. ​

8–9: F8−9 = y, require y + P8−9 ≥ 17. ​

9–10: F9−10 ​ = y, require y + P9−10 ≥ 7. ​

≤ 0.6 (Fslot + Pslot ). Equivalently

Part-time proportion (≤60%): In each slot, Pslot ​ ​ ​

Pslot ≤ 1.5 Fslot (since F + P = W , P ≤ 0.6W ⇒ 0.4P ≤ 0.6F ). For example in

​ ​

11–12, P11−12 ≤ 1.5x; in 1–2, P1−2 ≤ 1.5(x + y); etc.

​ ​

Non-negativity: x, y, Pslot ​ ≥ 0 (and integer in practice, but LP relaxes to ≥0).

Here the LP decides how many full-time staff in each shift and how many part-timers each
hour to minimize cost gurobi.com . We ensure enough workers each hour to meet demand,
and we enforce that part-timers do not exceed 60% of the workforce at any time. Each
constraint is linear. The result fits the LP framework of linear objective and linear constraints
ocw.mit.edu gurobi.com .

Question 4 (Virginia Tech Coal Blending)

Decision variables: Let x1 , x2 , x3 = fraction (or proportion) of coal types 1, 2, and 3 in
​ ​ ​

the blend (so x1 ​ + x2 + x3 = 1 ton). ​ ​

Objective function: Maximize steam output:

max Z = 24000x1 + 36000x2 + 28000x3 (pounds of steam per ton of blend).
​ ​ ​

Constraints:

Sulfur emission: 1100x1 ​ + 3500x2 + 1300x3 ≤ 2500 (ppm).

​ ​

Coal dust: 1.7x1 ​ + 3.2x2 + 2.4x3 ≤ 2.8 (kg).

​ ​

Blend total: x1 ​ + x 2 + x 3 = 1. ​ ​

Non-negativity: x1 , x2 , x3 ​ ​ ​ ≥ 0.

4/22
This LP chooses the blend proportions to maximize steam given EPA limits. The sulfur and
dust constraints ensure the weighted average emissions do not exceed the caps (the
problem states emissions and steam are weighted averages of the coal types
file-1qzovbjb2nvnf46j3qsfwp ). The objective and constraints are all linear in xi , fitting the LP form ​

ocw.mit.edu gurobi.com .

Question 5 (Quick-Print Garment Production)

Decision variables: Let SF , SBF , TF , TBF = number of Sweatshirt–F, Sweatshirt–B/F, T- ​ ​ ​

shirt–F, T-shirt–B/F to produce.

Objective function: Maximize profit:

max Z = 136SF + 148SBF + 126TF + 138TBF . ​ ​ ​ ​

Constraints:

Fabric: 2.50SF ​ + 2.75SBF + 1.85TF + 1.90TBF ≤ 720. ​ ​ ​

Time: 2.2SF ​ + 3.6SBF + 1.6TF + 3.2TBF ≤ 48 × 60 (minutes). ​ ​ ​

Box capacity: SF ​ + SBF + TF + TBF ≤ 350 × 12 = 4200 garments.

​ ​ ​

Budget: 290SF ​ + 426SBF + 144TF + 362TBF ≤ 850000. ​ ​ ​

Non-negativity: SF , SBF , TF , TBF ​ ​ ​ ​ ≥ 0.

We define production quantities for each garment type. The objective is to maximize total
profit (sum of profit per unit times units produced) gurobi.com . The constraints enforce
resource limits: fabric area, labor time, box capacity, and total cost. All equations and
inequalities are linear, yielding a standard LP model ocw.mit.edu gurobi.com .

Summary of final LP formulations:

Q1: Vars: Fm , Fp , Sm , Sp , Tm , Tp . Obj: min

​ 38Fm + 51Fp + 11.5Sm + 15Sp + 6.5Tm +
​ ​ ​ ​ ​ ​ ​ ​ ​ ​

9.5Tp . Constraints: Fm + Fp = 5000, Sm + Sp = 5000, Tm + Tp = 5000; 3.5Fm +

​ ​ ​ ​ ​ ​ ​ ​

1.3Sm + 0.8Tm ≤ 21000; 2.2Fm + 1.7Sm ≤ 25200; 3.1Fm + 2.6Sm + 2.5Tm ≤

​ ​ ​ ​ ​ ​ ​

34200.
Q2: Vars: x1 , x2 , x3 . Obj: min
0.50x1 + 0.70x2 + 0.45x3 . Constraints: 75x1 + 85x2 +
​ ​ ​ ​ ​ ​ ​ ​

60x3 ≥ 75(x1 + x2 + x3 ); 86x1 + 88x2 + 75x3 ≥ 80(x1 + x2 + x3 ); x1 + x2 + x3 =

​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​

1000; xi ≤ available. ​

5/22
 Q3: Vars: x, y (full-time counts), Pt (part-time count at each hour). Obj: min 110x +
110y + 7.6 ∑ Pt . Constraints: For each slot: (full-time on duty)+Pt ≥ required staff;
​ ​

Pt ≤ 1.5 × (full-time on duty).

​

Q4: Vars: x1 , x2 , x3 (blend fractions). Obj: max

​ 24000x1 + 36000x2 + 28000x3 .
​ ​ ​ ​ ​

Constraints: 1100x1 + 3500x2 + 1300x3 ≤ 2500; 1.7x1 + 3.2x2 + 2.4x3 ≤ 2.8;

​ ​ ​ ​ ​ ​

x 1 + x 2 + x 3 = 1.
​ ​ ​

Q5: Vars: SF , SBF , TF , TBF . Obj: max

136SF + 148SBF + 126TF + 138TBF . Constraints:
​ ​ ​ ​ ​ ​ ​ ​

2.50SF + 2.75SBF + 1.85TF + 1.90TBF ≤ 720; 2.2SF + 3.6SBF + 1.6TF +

​ ​ ​ ​ ​ ​ ​

3.2TBF ≤ 2880; SF + SBF + TF + TBF ≤ 4200; 290SF + 426SBF + 144TF +

​ ​ ​ ​ ​ ​ ​ ​

362TBF ≤ 850000. ​

Each model follows the standard LP structure: decision variables (quantities to produce or
use), a linear objective (to minimize cost or maximize profit/steam), and linear constraints for
demands, capacities, and other limits ocw.mit.edu gurobi.com . All variables have non-negativity
constraints.

Sources

use simple variables in all questions like x1 x2 etc

Got it! Below are all five linear programming formulations rewritten using simple variables
like x1 , x2 , …. Each problem includes:
​ ​

1. Decision Variables

2. Objective Function

3. Constraints

4. Non-negativity Conditions

5. Explanation

6. A bullet-point summary of final formulations at the end.

6/22
Question 1 – Spandex Knifelifter (Minimize Cost)

Decision Variables
x1 : Frames manufactured
​

x2 : Frames purchased
​

x3 : Supports manufactured
​

x4 : Supports purchased
​

x5 : Straps manufactured
​

x6 : Straps purchased
​

Objective Function
Minimize total cost:

min Z = 38x1 + 51x2 + 11.5x3 + 15x4 + 6.5x5 + 9.5x6

​ ​ ​ ​ ​ ​

Constraints
Demand constraints:

x1 + x2 = 5000
​ ​

x3 + x4 = 5000
​ ​

x5 + x6 = 5000
​ ​

Capacity constraints (in minutes; 1 hour = 60 minutes):

3.5x1 + 1.3x3 + 0.8x5 ≤ 21000

​ ​ ​ (Cutting)

2.2x1 + 1.7x3 ≤ 25200

​ ​ (Milling)

3.1x1 + 2.6x3 + 2.5x5 ≤ 34200

​ ​ ​
(Shaping)

Non-negativity

x1 , x2 , x3 , x4 , x5 , x6 ≥ 0
​ ​ ​ ​ ​ ​

Explanation
We assign variables for manufacturing and purchasing each component. Objective is to
minimize total cost. We ensure 5000 of each part are available and that production doesn't

7/22
exceed capacity in each department.

Question 2 – Coffee Blending (Minimize Cost)

Decision Variables
x1 : Pounds of Bean 1 used
​

x2 : Pounds of Bean 2 used

​

x3 : Pounds of Bean 3 used

​

Objective Function

min Z = 0.50x1 + 0.70x2 + 0.45x3 ​ ​ ​

Constraints
Aroma rating (weighted average ≥ 75):

75x1 + 85x2 + 60x3 ≥ 75(x1 + x2 + x3 )

​ ​ ​ ​ ​

Taste rating (weighted average ≥ 80):

86x1 + 88x2 + 75x3 ≥ 80(x1 + x2 + x3 )

​ ​ ​ ​ ​

Supply constraints:

x1 ≤ 500,
​ x2 ≤ 600,
​ x3 ≤ 400
​

Total weight constraint (assume 1000 lbs blend):

x1 + x2 + x3 = 1000
​ ​ ​

Non-negativity

x1 , x2 , x3 ≥ 0
​ ​ ​

Explanation
Each variable represents the pounds of a bean used. Ratings are enforced as weighted
averages. The goal is to create a blend of 1000 lbs at minimum cost.

8/22
Question 3 – SOB Restaurant (Minimize Labor Cost)

Decision Variables
x1 : Full-time employees in 11am shift
​

x2 : Full-time employees in 1pm shift

​

x3 to x13 : Part-time employees in each hour from 11am–12pm to 9–10pm

​ ​

Objective Function

min Z = 110x1 + 110x2 + 7.6(x3 + x4 + ⋯ + x13 )

​ ​ ​ ​ ​

Constraints
Let’s define required employees as follows:

Time Slot Total Needed Full-time Present

11–12 9 x1 ​

12–1 12 x1 ​

1–2 8 x1 + x2
​ ​

2–3 3 x1 + x2
​ ​

3–4 5 x2 ​

4–5 4 x1 + x2
​ ​

5–6 6 x1 ​

6–7 15 x1 + x2
​ ​

7–8 13 x1 + x2
​ ​

8–9 17 x2 ​

9–10 7 x2 ​

Example for 11–12:

9/22
 x1 + x3 ≥ 9,
​ ​ x3 ≤ 1.5x1
​ ​

Apply similar constraints for all slots up to 9–10pm.

Non-negativity

x1 , x2 , x3 , … , x13 ≥ 0
​ ​ ​ ​

Explanation
We model full-time and part-time staffing to minimize labor cost. Each hour's demand is
met with a mix of both, but part-timers must not exceed 60% of the total.

Question 4 – Coal Blending (Maximize Steam Output)

Decision Variables
x1 : Proportion of coal type 1
​

x2 : Proportion of coal type 2

​

x3 : Proportion of coal type 3

​

Objective Function

max Z = 24000x1 + 36000x2 + 28000x3 ​ ​ ​

Constraints
Sulfur limit:

1100x1 + 3500x2 + 1300x3 ≤ 2500

​ ​ ​

Coal dust limit:

1.7x1 + 3.2x2 + 2.4x3 ≤ 2.8

​ ​ ​

Total mix = 1 ton:

x1 + x2 + x3 = 1
​ ​ ​

Non-negativity

10/22
 x1 , x2 , x3 ≥ 0
​ ​ ​

Explanation
We create a blend of coals with weights summing to 1, and maximize steam output while
staying within EPA limits on emissions.

Question 5 – Quick-Print Garments (Maximize Profit)

Decision Variables
x1 : Sweatshirt–F
​

x2 : Sweatshirt–B/F
​

x3 : T-shirt–F
​

x4 : T-shirt–B/F
​

Objective Function

max Z = 136x1 + 148x2 + 126x3 + 138x4

​ ​ ​ ​

Constraints
Fabric:

2.5x1 + 2.75x2 + 1.85x3 + 1.9x4 ≤ 720

​ ​ ​ ​

Time (in minutes):

2.2x1 + 3.6x2 + 1.6x3 + 3.2x4 ≤ 2880

​ ​ ​ ​

Box space (350 boxes × 12 garments):

x1 + x2 + x3 + x4 ≤ 4200
​ ​ ​ ​

Budget:

290x1 + 426x2 + 144x3 + 362x4 ≤ 850000

​ ​ ​ ​

Non-negativity

11/22
 x1 , x2 , x3 , x4 ≥ 0
​ ​ ​ ​

Explanation
We decide how many of each garment to make to maximize profit, subject to fabric, time,
budget, and truck space.

✅ Final Answer Summary (Bullet Form)

Q1: Minimize
Z = 38x1 + 51x2 + 11.5x3 + 15x4 + 6.5x5 + 9.5x6
​ ​ ​ ​ ​ ​

s.t.
x1 + x2 = 5000, x3 + x4 = 5000, x5 + x6 = 5000
​ ​ ​ ​ ​ ​

3.5x1 + 1.3x3 + 0.8x5 ≤ 21000

​ ​ ​

2.2x1 + 1.7x3 ≤ 25200

​ ​

3.1x1 + 2.6x3 + 2.5x5 ≤ 34200

​ ​ ​

Q2: Minimize
Z = 0.50x1 + 0.70x2 + 0.45x3 ​ ​ ​

s.t.
75x1 + 85x2 + 60x3 ≥ 75(x1 + x2 + x3 )
​ ​ ​ ​ ​

86x1 + 88x2 + 75x3 ≥ 80(x1 + x2 + x3 )

​ ​ ​ ​ ​

x1 + x2 + x3 = 1000, x1 ≤ 500, x2 ≤ 600, x3 ≤ 400

​ ​ ​ ​ ​ ​

Q3: Minimize
Z = 110x1 + 110x2 + 7.6(x3 + ⋯ + x13 )
​ ​ ​ ​

s.t.
Hourly demand constraints: x1 ​ + x3 ≥ 9, etc.​

Part-time ≤ 60%: x3 ​ ≤ 1.5x1 , etc. ​

Q4: Maximize
Z = 24000x1 + 36000x2 + 28000x3 ​ ​ ​

s.t.
1100x1 + 3500x2 + 1300x3 ≤ 2500
​ ​ ​

1.7x1 + 3.2x2 + 2.4x3 ≤ 2.8

​ ​ ​

x1 + x2 + x3 = 1
​ ​ ​

12/22
 Q5: Maximize
Z = 136x1 + 148x2 + 126x3 + 138x4
​ ​ ​ ​

s.t.
2.5x1 + 2.75x2 + 1.85x3 + 1.9x4 ≤ 720
​ ​ ​ ​

2.2x1 + 3.6x2 + 1.6x3 + 3.2x4 ≤ 2880

​ ​ ​ ​

x1 + x2 + x3 + x4 ≤ 4200
​ ​ ​ ​

290x1 + 426x2 + 144x3 + 362x4 ≤ 850000

​ ​ ​ ​

Let me know if you want this as a Word file or PDF for LMS upload!

Formulate the above 5 problems as an appropriate Linear

Programs

Sure! Below are the linear programming formulations for all five problems, written clearly
and precisely using simple variables x1 , x2 , …. The structure includes:
​ ​

Decision Variables

Objective Function

Constraints

Non-negativity Conditions

Q1: Spandex Knifelifter Production – Minimize Cost

Decision Variables
x1 : Number of frames manufactured
​

x2 : Number of frames purchased

​

x3 : Number of supports manufactured

​

x4 : Number of supports purchased

​

x5 : Number of straps manufactured

​

x6 : Number of straps purchased

​

Objective Function

13/22
 min Z = 38x1 + 51x2 + 11.5x3 + 15x4 + 6.5x5 + 9.5x6
​ ​ ​ ​ ​ ​

Constraints
Demand:

x1 + x2 = 5000
​ ​

x3 + x4 = 5000
​ ​

x5 + x6 = 5000
​ ​

Department Capacities (converted to minutes):

3.5x1 + 1.3x3 + 0.8x5 ≤ 21000

​ ​ ​ (Cutting)

2.2x1 + 1.7x3 ≤ 25200

​ ​ (Milling)

3.1x1 + 2.6x3 + 2.5x5 ≤ 34200

​ ​ ​
(Shaping)

Non-Negativity

x1 , x2 , x3 , x4 , x5 , x6 ≥ 0
​ ​ ​ ​ ​ ​

Q2: Coffee Blend – Minimize Cost

Decision Variables
x1 : Pounds of Bean 1 used
​

x2 : Pounds of Bean 2 used

​

x3 : Pounds of Bean 3 used

​

Objective Function

min Z = 0.50x1 + 0.70x2 + 0.45x3 ​ ​ ​

Constraints
Aroma Rating:

75x1 + 85x2 + 60x3 ≥ 75(x1 + x2 + x3 )

​ ​ ​ ​ ​

14/22
 Taste Rating:

86x1 + 88x2 + 75x3 ≥ 80(x1 + x2 + x3 )

​ ​ ​ ​ ​

Supply Limits:

x1 ≤ 500,
​ x2 ≤ 600,
​ x3 ≤ 400 ​

Total Blend Requirement:

x1 + x2 + x3 = 1000
​ ​ ​

Non-Negativity

x1 , x2 , x3 ≥ 0
​ ​ ​

Q3: SOB Restaurant Scheduling – Minimize Labor Cost

Decision Variables
x1 : Full-time employees starting at 11:00 AM
​

x2 : Full-time employees starting at 1:00 PM

​

x3 to x13 : Part-time employees working in each time slot:

​ ​

x3 : 11–12, x4 : 12–1, ..., x13 : 9–10

​ ​ ​

Objective Function

min Z = 110x1 + 110x2 + 7.6(x3 + x4 + ⋯ + x13 )

​ ​ ​ ​ ​

Constraints
Time Slot Required Full-time on duty Constraint

11–12 9 x1 ​ x1 + x3 ≥ 9, x3 ≤ 1.5x1
​ ​ ​ ​

12–1 12 x1 ​ x1 + x4 ≥ 12, x4 ≤ 1.5x1

​ ​ ​ ​

1–2 8 x1 + x2
​ ​ x1 + x2 + x5 ≥ 8, x5 ≤ 1.5(x1 + x2 )
​ ​ ​ ​ ​ ​

2–3 3 x1 + x2
​ ​ x1 + x2 + x6 ≥ 3, x6 ≤ 1.5(x1 + x2 )
​ ​ ​ ​ ​ ​

15/22
Time Slot Required Full-time on duty Constraint

3–4 5 x2 ​ x2 + x7 ≥ 5, x7 ≤ 1.5x2
​ ​ ​ ​

4–5 4 x1 + x2
​ ​ x1 + x2 + x8 ≥ 4, x8 ≤ 1.5(x1 + x2 )
​ ​ ​ ​ ​ ​

5–6 6 x1 ​ x1 + x9 ≥ 6, x9 ≤ 1.5x1
​ ​ ​ ​

6–7 15 x1 + x2
​ ​ x1 + x2 + x10 ≥ 15, x10 ≤ 1.5(x1 + x2 )
​ ​ ​ ​ ​ ​

7–8 13 x1 + x2
​ ​ x1 + x2 + x11 ≥ 13, x11 ≤ 1.5(x1 + x2 )
​ ​ ​ ​ ​ ​

8–9 17 x2 ​ x2 + x12 ≥ 17, x12 ≤ 1.5x2

​ ​ ​ ​

9–10 7 x2 ​ x2 + x13 ≥ 7, x13 ≤ 1.5x2

​ ​ ​ ​

Non-Negativity

x1 , x2 , x3 , ..., x13 ≥ 0
​ ​ ​ ​

Q4: Virginia Tech Coal Blending – Maximize Steam

Decision Variables
x1 : Fraction of coal type 1
​

x2 : Fraction of coal type 2

​

x3 : Fraction of coal type 3

​

Objective Function

max Z = 24000x1 + 36000x2 + 28000x3

​ ​ ​

Constraints
Sulfur:

1100x1 + 3500x2 + 1300x3 ≤ 2500

​ ​ ​

Coal Dust:

16/22
 1.7x1 + 3.2x2 + 2.4x3 ≤ 2.8
​ ​ ​

Total mix:

x1 + x2 + x3 = 1
​ ​ ​

Non-Negativity

x1 , x2 , x3 ≥ 0 ​ ​ ​

Q5: Quick-Print Garments – Maximize Profit

Decision Variables
x1 : Sweatshirt–F
​

x2 : Sweatshirt–B/F
​

x3 : T-shirt–F
​

x4 : T-shirt–B/F
​

Objective Function

max Z = 136x1 + 148x2 + 126x3 + 138x4 ​ ​ ​ ​

Constraints
Fabric constraint:

2.5x1 + 2.75x2 + 1.85x3 + 1.9x4 ≤ 720

​ ​ ​ ​

Time constraint (48 hours = 2880 minutes):

2.2x1 + 3.6x2 + 1.6x3 + 3.2x4 ≤ 2880

​ ​ ​ ​

Truck capacity (350 boxes × 12 garments):

x1 + x2 + x3 + x4 ≤ 4200
​ ​ ​ ​

Budget constraint:

290x1 + 426x2 + 144x3 + 362x4 ≤ 850000

​ ​ ​ ​

17/22
Non-Negativity

x1 , x2 , x3 , x4 ≥ 0
​ ​ ​ ​

Let me know if you’d like this copied into a Word document or formatted for LMS submission!

do q3 again , write each and everry constraint properly

Sure! Here's the complete and detailed linear program formulation for Q3 (SOB
Restaurant Scheduling) with each and every constraint written out properly.

Q3: SOB Restaurant Employee Scheduling – Minimize

Labor Cost

Decision Variables
x1 : Number of full-time employees starting at 11:00 A.M.
​

x2 : Number of full-time employees starting at 1:00 P.M.

​

x3 to x13 : Number of part-time employees working during each 1-hour time slot:
​ ​

Variable Time Slot

x3 ​ 11:00–12:00

x4 ​ 12:00–1:00

x5 ​ 1:00–2:00

x6 ​ 2:00–3:00

x7 ​ 3:00–4:00

x8 ​ 4:00–5:00

x9 ​ 5:00–6:00

18/22
Variable Time Slot

x10 ​ 6:00–7:00

x11 ​ 7:00–8:00

x12 ​ 8:00–9:00

x13 ​ 9:00–10:00

Objective Function
Minimize total labor cost:

min Z = 110x1 + 110x2 + 7.6(x3 + x4 + x5 + x6 + x7 + x8 + x9 + x10 + x11 + x12 + x13 )

​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​

Constraints

Hourly Demand Constraints

Each time slot must be staffed with at least the number of required employees (full-time +
part-time):

1. 11:00–12:00
Full-time: x1

x1 + x3 ≥ 9
​ ​

2. 12:00–1:00
Full-time: x1

x1 + x4 ≥ 12
​ ​

3. 1:00–2:00
Full-time: x1 + x2 ​

x1 + x2 + x5 ≥ 8
​ ​ ​

4. 2:00–3:00
Full-time: x1 + x2 ​

19/22
 x1 + x2 + x6 ≥ 3
​ ​ ​

5. 3:00–4:00
Full-time: x2

x2 + x7 ≥ 5
​ ​

6. 4:00–5:00
Full-time: x1 + x2 ​

x1 + x2 + x8 ≥ 4
​ ​ ​

7. 5:00–6:00
Full-time: x1

x1 + x9 ≥ 6
​ ​

8. 6:00–7:00
Full-time: x1 + x2 ​

x1 + x2 + x10 ≥ 15
​ ​

9. 7:00–8:00
Full-time: x1 + x2 ​

x1 + x2 + x11 ≥ 13
​ ​

10. 8:00–9:00
Full-time: x2

x2 + x12 ≥ 17
​ ​

11. 9:00–10:00
Full-time: x2

x2 + x13 ≥ 7​ ​

Part-Time Proportion Constraints

Part-time employees must not exceed 60% of the total workforce at any time. This is
equivalent to:

xpart-time ≤ 1.5 × xfull-time

​ ​

So we write:

20/22
 1. 11:00–12:00

x3 ≤ 1.5x1
​ ​

2. 12:00–1:00

x4 ≤ 1.5x1
​ ​

3. 1:00–2:00

x5 ≤ 1.5(x1 + x2 )
​ ​ ​

4. 2:00–3:00

x6 ≤ 1.5(x1 + x2 )
​ ​ ​

5. 3:00–4:00

x7 ≤ 1.5x2
​ ​

6. 4:00–5:00

x8 ≤ 1.5(x1 + x2 )
​ ​ ​

7. 5:00–6:00

x9 ≤ 1.5x1
​ ​

8. 6:00–7:00

x10 ≤ 1.5(x1 + x2 )
​ ​ ​

9. 7:00–8:00

x11 ≤ 1.5(x1 + x2 )
​ ​ ​

10. 8:00–9:00

x12 ≤ 1.5x2 ​ ​

11. 9:00–10:00

x13 ≤ 1.5x2 ​ ​

Non-Negativity Constraints

x1 , x2 , x3 , … , x13 ≥ 0
​ ​ ​ ​

21/22
Let me know if you want all five questions compiled in one document or if you'd like a
downloadable version.

22/22