• Skip to primary navigation
  • Skip to main content
  • Skip to primary sidebar
  • Lee L. Lowery, Jr., PhD, P.E.
  • Research
  • People
  • Contact

Lee L. Lowery, Jr.

Just another CoE WordPress site

Texas A&M University College of Engineering

Problem: 5-2

Posted on July 27, 2021 by Abigail Stason

Given: You are a planning engineer for a metropolitan area. You want to minimize the cost of land filling the refuse produced by Cities A, B, C, and D under your jurisdiction. Three of the cities have landfills (G, H, and I), but their capacities do not match up with the amount of waste produced in each city. Each city produces the following amount of refuse: A – 100 tons/day, B – 50 tons/day, C – 60 tons/day, D – 40 tons/day.

The city landfills have the following capacities: G – 50 tons/day, H – 75 tons/day, I – 150 tons/day

The cost per ton for hauling and land filling are given in the following matrix:

To Landfills G,H,I
From Cities A,B,C,D G H I
A 10 20 30
B 18 12 16
C 22 18 26
D 28 20 8

Required: Solve this as a linear programming problem to minimize the total cost of disposing of all trash.

Filed Under: Uncategorized

Pages

  • Contact
  • Lee L. Lowery, Jr., PhD, P.E.
  • Office Hours

© 2016–2025 Lee L. Lowery, Jr. Log in

Texas A&M Engineering Experiment Station Logo
  • College of Engineering
  • Facebook
  • Twitter
  • State of Texas
  • Open Records
  • Risk, Fraud & Misconduct Hotline
  • Statewide Search
  • Site Links & Policies
  • Accommodations
  • Environmental Health, Safety & Security
  • Employment