Operations Research: Applications and Algorithms
Operations Research: Applications and Algorithms
4th Edition
ISBN: 9780357907818
Author: WINSTON
Publisher: Cengage Learning US
Expert Solution & Answer
Book Icon
Chapter 5.3, Problem 4P

Explanation of Solution

Calculating the extra payment:

  • Let xmn is the number of units of product n at plant m.
  • In order to minimize the cost of meeting these demands, the following Linear Programming has to be solved:
  • min z= 5x11+6x12+8x13+8x21+7x22+10x23
  • Such that,
    • x11+x12+x1310,000
    • x21+x22+x2310,000
    • x11+x216,000
    • x12+x228,000
    • x13+x235,000
    • All variables ≥ 0
  • The output of this Linear Programming is given below:
  • min z= 5x11+6x12+8x13+8x21+7x22+10x23
  • Subject to constraint
    • x11+x12+x1310,000
    • x21+x22+x2310,000
    • x11+x216,000
    • x12+x228,000
    • x13+x235,000
  • End
  • LP optimum is found at step 2

Blurred answer
Students have asked these similar questions
Show all the work
Construct a frequency polygon density estimate for the sample in Question 1, using bin width determined by Sturges’ Rule.
Show all the work
Knowledge Booster
Background pattern image
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
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning