Decision Variables Cakes (x1) Danishes (x2) Objective Function Max Z = $1x1 +5x2 Constraints 5x1+5x2 ≤25 (flour, lb.) 2x1 + 4x2 ≤16 (sugar, lb.) x1 ≤5 (demand, cakes) x1, x2 ≥0 Module 1 Spreadsheet Assignment Linear Program Model: Crumb and Custard Bakery Products Cakes Danishes Profit per item: 1 5 Resources: Usage Constraint Available Left over Flour (lb) 5 5 < 25 Sugar (lb) Demand (cakes) 2 4 < 16 1 0 5 Production: Cakes= Danishes= Profit=|

Decision Variables Cakes (x1) Danishes (x2) Objective Function Max Z = $1x1 +5x2 Constraints 5x1+5x2 ≤25 (flour, lb.) 2x1 + 4x2 ≤16 (sugar, lb.) x1 ≤5 (demand, cakes) x1, x2 ≥0 Module 1 Spreadsheet Assignment Linear Program Model: Crumb and Custard Bakery Products Cakes Danishes Profit per item: 1 5 Resources: Usage Constraint Available Left over Flour (lb) 5 5 < 25 Sugar (lb) Demand (cakes) 2 4 < 16 1 0 5 Production: Cakes= Danishes= Profit=|

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter7: Nonlinear Optimization Models

Section: Chapter Questions

Problem 56P

See similar textbooks