代写DAT5567 – Prescriptive Analytics Fall 2025 Module 5: Linear Optimization with Integer Variables代做P

DAT5567 – Prescriptive Analytics

Fall 2025

Module 5: Linear Optimization with Integer Variables

Lab Problem Set

Required Problems: 1-3

Please upload to Canvas both the .ipynbfile as well as an .html or .pdf rendering of that file with the solution output displayed. You can solve the problems in a single notebook or in separate notebooks (but please label them clearly). You are not required to provide the mathematical formulation (but are strongly encouraged to have it handy before you start writing your code).

Additional optional problems: 4-5

Problems labelled with an asterisk (*) are more challenging

Problem 1

(Fixed Cost) Radford Castings can produce brake shoes on six different machines. The following table summarizes the manufacturing costs associated with producing the brake shoes on each machine along with the available capacity on each machine. If the company has received an order for 1,800 brake shoes, how should it schedule these machines?

a. Formulate a (mixed-) integer linear optimization model for this problem.

b. Construct a PuLP model for this problem and solve it.

c. What is the optimal solution?

Problem 2

(Set-covering) Health Care Systems of Florida (HCSF) is planning to build a number of new emergency-care clinics in central Florida. HCSF management has divided a map of the area into seven regions. They want to locate the emergency centers so that all seven regions will be conveniently served by at least one facility.  Five possible sites are available for constructing the new facilities. The regions that can be served conveniently by each site are indicated by X in the following table:

a. Formulate a (mixed-) integer linear optimization model to determine which sites should be selected so as to provide convenient service to all locations in the least costly manner.

b. Construct a PuLP model for this problem and solve it.

c. What is the optimal solution?

Problem 3

(Minimum Order) Clampett Oil purchases crude oil products from suppliers in Texas (TX), Oklahoma (OK), Pennsylvania (PA), and Alabama (AL), from which it refines four end-products: gasoline, kerosene, heating oil, and asphalt. Because of differences in the quality and chemical characteristics of the oil from the different suppliers, the amount of each end product that can be refined from a barrel of crude oil varies depending on the source of the crude. Additionally, the amount of crude available from each source varies, as does the cost of a barrel of crude from each supplier. These values are summarized below. For example, the first line of this table indicates that a barrel of crude oil from Texas can be refined into 2 barrels of gasoline, 2.8 barrels of kerosene, 1.7 barrels of heating oil, or 2.4 barrels of asphalt. Each supplier requires a minimum purchase of at least 500 barrels.

The company owns a tanker truck that picks up whatever crude oil it purchases. This truck can hold 2,000 barrels of crude. The cost of sending the truck to pick up oil from the various locations is shown in the column labeled  “Trucking  Cost.”  The company s plans for its next production cycle specify 750 barrels of gasoline, 800 barrels of kerosene, 1,000 barrels of heating oil, and 300 barrels of asphalt to be produced.

a. Formulate a (mixed-) integer linear optimization model that can be solved to determine the purchasing plan that will allow the company to implement its production plan at the least cost.

b. Construct a PuLP model for this problem and solve it.

c. What is the optimal solution?

Problem 4

(Trasportation) Tropicsun is a leading grower and distributor of fresh citrus products with three large citrus groves scattered around central Florida in the cities of Mt. Dora, Eustis, and Clermont. Tropicsun currently has 275,000 bushels of citrus at the grove in Mt. Dora, 400,000 bushels at the grove in Eustis, and 300,000 at the grove in Clermont. Tropicsun has citrus processing plants in Ocala, Orlando, and Leesburg with

processing capacities to handle 200,000, 600,000, and 225,000 bushels, respectively. Tropicsun contracts with a local trucking company to transport its fruit from the groves to the processing plants. The trucking company charges a flat rate of $8 per mile regardless of how many bushels of fruit are transported. The  following table summarizes the distances (in miles) between each grove and processing plant:

Tropicsun wants to determine how many bushels to ship from each grove to each processing plant to minimize the total transportation cost.

a. Formulate a (mixed-) integer linear optimization model for this problem

b. Create a PuLP model for this problem and solve it.

c. What is the optimal solution?

Problem 5*

Universal Technologies, Inc. has identified two qualified vendors with the capability to supply some of its electronic components. For the coming year, Universal has estimated its volume requirements for these components and obtained price-break schedules from each vendor. (These are summarized as “all-units” price discounts in the table below.)

All-units price discounts work as follows. Take Vendor A and Product 3 for example. If 1,400 units are purchased from Vendor A, each of the 1,400 units costs $56 each, and the total cost is $56*1,400=$78,400.

Universal s engineers have also estimated each vendor s maximum capacity for producing these components, based on available information about equipment in use and labor policies in effect.

Finally, because of its limited history with Vendor A, Universal has adopted a policy that permits no more than 60% of its total unit purchases on these components to come from Vendor A.

a. Formulate a (mixed-) integer linear optimization model that finds the minimum-cost plan for Universal.

b. Construct a PuLP model for this problem and solve it.

c. What is the optimal solution?

d. Suppose that Vendor A provides a new price-discount schedule for component 3. This one is an “incremental” discount, as opposed to an “all-units” discount, as follows.

Unit price = $60 on all units up to 1000

Unit price = $56 on the next 1000 units

Unit price = $51 on the next 500 units

With the change in pricing at Vendor A, what is the minimum purchasing cost for Universal, and what is the impact on the optimal purchase plan (compared to Part (c))?




热门主题

课程名

mktg2509 csci 2600 38170 lng302 csse3010 phas3226 77938 arch1162 engn4536/engn6536 acx5903 comp151101 phl245 cse12 comp9312 stat3016/6016 phas0038 comp2140 6qqmb312 xjco3011 rest0005 ematm0051 5qqmn219 lubs5062m eee8155 cege0100 eap033 artd1109 mat246 etc3430 ecmm462 mis102 inft6800 ddes9903 comp6521 comp9517 comp3331/9331 comp4337 comp6008 comp9414 bu.231.790.81 man00150m csb352h math1041 eengm4100 isys1002 08 6057cem mktg3504 mthm036 mtrx1701 mth3241 eeee3086 cmp-7038b cmp-7000a ints4010 econ2151 infs5710 fins5516 fin3309 fins5510 gsoe9340 math2007 math2036 soee5010 mark3088 infs3605 elec9714 comp2271 ma214 comp2211 infs3604 600426 sit254 acct3091 bbt405 msin0116 com107/com113 mark5826 sit120 comp9021 eco2101 eeen40700 cs253 ece3114 ecmm447 chns3000 math377 itd102 comp9444 comp(2041|9044) econ0060 econ7230 mgt001371 ecs-323 cs6250 mgdi60012 mdia2012 comm221001 comm5000 ma1008 engl642 econ241 com333 math367 mis201 nbs-7041x meek16104 econ2003 comm1190 mbas902 comp-1027 dpst1091 comp7315 eppd1033 m06 ee3025 msci231 bb113/bbs1063 fc709 comp3425 comp9417 econ42915 cb9101 math1102e chme0017 fc307 mkt60104 5522usst litr1-uc6201.200 ee1102 cosc2803 math39512 omp9727 int2067/int5051 bsb151 mgt253 fc021 babs2202 mis2002s phya21 18-213 cege0012 mdia1002 math38032 mech5125 07 cisc102 mgx3110 cs240 11175 fin3020s eco3420 ictten622 comp9727 cpt111 de114102d mgm320h5s bafi1019 math21112 efim20036 mn-3503 fins5568 110.807 bcpm000028 info6030 bma0092 bcpm0054 math20212 ce335 cs365 cenv6141 ftec5580 math2010 ec3450 comm1170 ecmt1010 csci-ua.0480-003 econ12-200 ib3960 ectb60h3f cs247—assignment tk3163 ics3u ib3j80 comp20008 comp9334 eppd1063 acct2343 cct109 isys1055/3412 math350-real math2014 eec180 stat141b econ2101 msinm014/msing014/msing014b fit2004 comp643 bu1002 cm2030
联系我们
EMail: 99515681@qq.com
QQ: 99515681
留学生作业帮-留学生的知心伴侣!
工作时间:08:00-21:00
python代写
微信客服:codinghelp
站长地图