Introduction to mathematical programming
Introduction to mathematical programming
4th Edition
ISBN: 9780534359645
Author: Jeffrey B. Goldberg
Publisher: Cengage Learning
bartleby

Concept explainers

Expert Solution & Answer
Book Icon
Chapter 4.16, Problem 2P

Explanation of Solution

Using preemptive goal programming to determine a purchasing strategy:

  • In the given problem, the Fruit Company has a budget constraint of $28000 to spend on 5000 excellent chips, 3000 good chips, and 1000 mediocre chips.
  • If Fruit does not obtain enough chips of a given quality, the company may special –order additional chips at $10 per excellent chips, $6 per good chips and $4 per mediocre chip. But a penalty of $1 for each dollar by which the amount paid to supplier 1-3 exceeds the annual budget.
  • Here, the user has to obtain the constraint equations and solve the linear equation to finding the penalty cost that will help the Fruit Company to minimize the penalty and meet its requirement of purchasing the chips annually.

Below given table gives the summary of the problem.

 Characteristics of a Lot of 100 chipsPrice per 100 chipsCost of 1 chip  
 ExcellentGoodMediocre  
Supplier 1602020$400$4.00
Supplier 2503515$300$3.00
Supplier 3402040$250$2.50
Total500030001000$28,000 
Penalty cost$10 per chip46 per chip$4 per chip $1 for every dollar over budget

Consider the below given variables,

Lets, X1 be the number of excellent lots provided by Supplier and X2 be the number of good lots provided by Supplier and X3 be the number of mediocre lots provided by Supplier.

To obtain 5000 excellent chips from all three suppliers, the below given equation can be used.

60X1+50X2+40X35,000$0.00$2,000($)Above*

To obtain 3000 good chips from all three suppliers, the below given equation can be used.

20X1+35X2+20X33,000

To obtain 1000 mediocre chips from all three suppliers, the below given equation can be used.

20X1+15X2+40X31,000

As the Fruit Company operates on a budget, there exist a fourth constraint. This constraint will keep the Fruit Company as receiver as the suppliers may not demand the Fruit Company to ship chips to them.

Owing to the budget of $28,000 with Supplier 1, Supplier 2, and Supplier 3 charging $400, $300 and $250 per lot respectively the constraint equation can be given below.

400X1+300X2+250X328,000

The above mentioned 4 constraints are flexible. That is the solution that minimizes the cost can either below or above the goal while it still can be used. The deviation variables S1P,S1N,S2P,S2N,S3P,S3N,S4P,S4N are defined to overcome from the above.

S1P= Deviation variable amount if excellent chips goal is over satisfying

S1N= Deviation variable amount if excellent chips goal is under satisfying

S2P= Deviation variable amount if good chips goal is over satisfying

S2N= Deviation variable amount if good chips goal is under satisfying

S3P= Deviation variable amount if mediocre chips goal is over satisfying

S3N= Deviation variable amount if mediocre chips goal is under satisfying

S4P= Deviation variable amount if budget constraint is over satisfying

S4N= Deviation variable amount if budget constraint is under satisfying

The above deviation variables are made use to be obtain the below constraints

60X1+50X2+40X3+S1N-S1P=5,00020X1+35X2+20X3+S2N-S2P=3,00020X1+15X2+40X3+S3N-S3P=1,000400X1+300X2+250X3+S4N-S4P=28,000

Objective function:

The objective of the problem is to minimize the penalty cost particularly for additional chips that cost $10 for excellent, $6 for good and $4 for mediocre

Blurred answer
Students have asked these similar questions
I need to render an image of a car continuously for a smooth visual experience in C# WinForms. It gets the location array (that has all the x,y of the tiles it should visit) from another function - assume it is already written.
write c program with features: Register a Bunny: Store the bunny's name, poem, and initialize the egg count to 0. Modify an Entry: Change the bunny's poem or update the egg count. Delete a Bunny: Remove a registered bunny from the list. List All Bunnies: Display all registered bunnies and their details. Save & Load Data: Store bunny data in a file to persist between runs. Use a struct to represent a bunny contestant. Store data in a binary file (bunnies.dat) for persistence. Use file I/O functions (fopen, fwrite, fread, etc.) to manage data. Implement a menu-driven interface for user interaction.
Help, how do I write the pseudocode for the findMean function and flowchart for this?

Chapter 4 Solutions

Introduction to mathematical programming

Ch. 4.5 - Prob. 1PCh. 4.5 - Prob. 2PCh. 4.5 - Prob. 3PCh. 4.5 - Prob. 4PCh. 4.5 - Prob. 5PCh. 4.5 - Prob. 6PCh. 4.5 - Prob. 7PCh. 4.6 - Prob. 1PCh. 4.6 - Prob. 2PCh. 4.6 - Prob. 3PCh. 4.6 - Prob. 4PCh. 4.7 - Prob. 1PCh. 4.7 - Prob. 2PCh. 4.7 - Prob. 3PCh. 4.7 - Prob. 4PCh. 4.7 - Prob. 5PCh. 4.7 - Prob. 6PCh. 4.7 - Prob. 7PCh. 4.7 - Prob. 8PCh. 4.7 - Prob. 9PCh. 4.8 - Prob. 1PCh. 4.8 - Prob. 2PCh. 4.8 - Prob. 3PCh. 4.8 - Prob. 4PCh. 4.8 - Prob. 5PCh. 4.8 - Prob. 6PCh. 4.10 - Prob. 1PCh. 4.10 - Prob. 2PCh. 4.10 - Prob. 3PCh. 4.10 - Prob. 4PCh. 4.10 - Prob. 5PCh. 4.11 - Prob. 1PCh. 4.11 - Prob. 2PCh. 4.11 - Prob. 3PCh. 4.11 - Prob. 4PCh. 4.11 - Prob. 5PCh. 4.11 - Prob. 6PCh. 4.12 - Prob. 1PCh. 4.12 - Prob. 2PCh. 4.12 - Prob. 3PCh. 4.12 - Prob. 4PCh. 4.12 - Prob. 5PCh. 4.12 - Prob. 6PCh. 4.13 - Prob. 2PCh. 4.14 - Prob. 1PCh. 4.14 - Prob. 2PCh. 4.14 - Prob. 3PCh. 4.14 - Prob. 4PCh. 4.14 - Prob. 5PCh. 4.14 - Prob. 6PCh. 4.14 - Prob. 7PCh. 4.16 - Prob. 1PCh. 4.16 - Prob. 2PCh. 4.16 - Prob. 3PCh. 4.16 - Prob. 5PCh. 4.16 - Prob. 7PCh. 4.16 - Prob. 8PCh. 4.16 - Prob. 9PCh. 4.16 - Prob. 10PCh. 4.16 - Prob. 11PCh. 4.16 - Prob. 12PCh. 4.16 - Prob. 13PCh. 4.16 - Prob. 14PCh. 4.17 - Prob. 1PCh. 4.17 - Prob. 2PCh. 4.17 - Prob. 3PCh. 4.17 - Prob. 4PCh. 4.17 - Prob. 5PCh. 4.17 - Prob. 7PCh. 4.17 - Prob. 8PCh. 4 - Prob. 1RPCh. 4 - Prob. 2RPCh. 4 - Prob. 3RPCh. 4 - Prob. 4RPCh. 4 - Prob. 5RPCh. 4 - Prob. 6RPCh. 4 - Prob. 7RPCh. 4 - Prob. 8RPCh. 4 - Prob. 9RPCh. 4 - Prob. 10RPCh. 4 - Prob. 12RPCh. 4 - Prob. 13RPCh. 4 - Prob. 14RPCh. 4 - Prob. 16RPCh. 4 - Prob. 17RPCh. 4 - Prob. 18RPCh. 4 - Prob. 19RPCh. 4 - Prob. 20RPCh. 4 - Prob. 21RPCh. 4 - Prob. 22RPCh. 4 - Prob. 23RPCh. 4 - Prob. 24RPCh. 4 - Prob. 26RPCh. 4 - Prob. 27RPCh. 4 - Prob. 28RP
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole
Text book image
A Guide to SQL
Computer Science
ISBN:9781111527273
Author:Philip J. Pratt
Publisher:Course Technology Ptr
Text book image
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:9781337508841
Author:Carey
Publisher:Cengage
Text book image
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
Computer Science
ISBN:9780357392676
Author:FREUND, Steven
Publisher:CENGAGE L
Text book image
Information Technology Project Management
Computer Science
ISBN:9781337101356
Author:Kathy Schwalbe
Publisher:Cengage Learning