Operations Research : Applications and Algorithms
Operations Research : Applications and Algorithms
4th Edition
ISBN: 9780534380588
Author: Wayne L. Winston
Publisher: Brooks Cole
Expert Solution & Answer
Book Icon
Chapter 3.10, Problem 6P

Explanation of Solution

Formulation of Linear Programming (LP):

  • Assume the following,
    • Let “Sm” be the shirts made in the month “m” at regular time.
    • Sm'” be the shirts made in the month “m” at overtime.
    • Pm” be the pants made in the month “m” at regular time.
    • Pm'” be the pans made in the month “m” at overtime.
    • SIm” be the demands for shirts in inventory at the end of the month “m”.
    • PIm” be the demands for pants in inventory at the end of the month “m”.
  • The Linear Programming (LP) is formulated as follows,

min z=4(S1+P1+S2+P2)+8(S1'+P1'+S2'+P2')+3(SI1+PI1+SI2+PI2)

such that,

  • All variables >= “0”.
  • SI1 = 1+S1+S1'1” that denotes the demands for the shirts in inventory at the end of the month “1”.
  • SI2 = SI1+S2+S2'12 ” that denotes the demands for the shirts in inventory at the end of the month “2”

Blurred answer
Students have asked these similar questions
A company uses four special tank trucks to deliver four different gasoline products to customers. Eachtank has five compartments with capacities: 500, 750, 1200, 1500, and 1750 gallons. The daily demands forthe four products are 10000, 15000, 12000, and 8000 gallons. Any quantities that cannot be delivered by thecompany’s four trucks must be subcontracted at the additional costs of 5, 12, 8, and 10 cents per gallon forproducts 1, 2, 3, and 4, respectively. The goal is to develop the optimal daily loading schedule for the fourtrucks that will minimize the additional cost of subcontracting. Formulate this problem as an integer linearprogram, and solve it (not by hand).
IKEO is a furniture manufacturer which produces two sizes of wood blocks (type A and B) thatare used to make either a table or a chair. A table is made of a type A and a type B wood blocks,while a chair is made of a type A and two type B wood blocks.A table makes RM 3 profit, and a chair makes RM 5 profit. If M number of type A and Nnumber of type B wood blocks are produced, how many tables and chairs should themanufacturer make to obtain the greatest profit?For example, let M = 12 and N = 12.By making 4 tables (4 type A and 4 type B) and 4 chairs (4 type A and 8 type B), themanufacturer gain profit as follows,Profit = (RM 3) × 4 + (RM 5) × 4 = RM 32.If the manufacturer makes 2 more tables and 1 less chair, the profit will be increased as follows,Profit = (RM 3) × 6 + (RM 5) × 3 = RM 33.Is this the greatest profit?Write a complete C++ program to help the manufacturer determine the greatest profit obtainfrom making tables and chairs with a given number of M type A and N type B wood…

Chapter 3 Solutions

Operations Research : Applications and Algorithms

Ch. 3.2 - Prob. 6PCh. 3.3 - Prob. 1PCh. 3.3 - Prob. 2PCh. 3.3 - Prob. 3PCh. 3.3 - Prob. 4PCh. 3.3 - Prob. 5PCh. 3.3 - Prob. 6PCh. 3.3 - Prob. 7PCh. 3.3 - Prob. 8PCh. 3.3 - Prob. 9PCh. 3.3 - Prob. 10PCh. 3.4 - Prob. 1PCh. 3.4 - Prob. 2PCh. 3.4 - Prob. 3PCh. 3.4 - Prob. 4PCh. 3.5 - Prob. 1PCh. 3.5 - Prob. 2PCh. 3.5 - Prob. 3PCh. 3.5 - Prob. 4PCh. 3.5 - Prob. 5PCh. 3.5 - Prob. 6PCh. 3.5 - Prob. 7PCh. 3.6 - Prob. 1PCh. 3.6 - Prob. 2PCh. 3.6 - Prob. 3PCh. 3.6 - Prob. 4PCh. 3.6 - Prob. 5PCh. 3.7 - Prob. 1PCh. 3.8 - Prob. 1PCh. 3.8 - Prob. 2PCh. 3.8 - Prob. 3PCh. 3.8 - Prob. 4PCh. 3.8 - Prob. 5PCh. 3.8 - Prob. 6PCh. 3.8 - Prob. 7PCh. 3.8 - Prob. 8PCh. 3.8 - Prob. 9PCh. 3.8 - Prob. 10PCh. 3.8 - Prob. 11PCh. 3.8 - Prob. 12PCh. 3.8 - Prob. 13PCh. 3.8 - Prob. 14PCh. 3.9 - Prob. 1PCh. 3.9 - Prob. 2PCh. 3.9 - Prob. 3PCh. 3.9 - Prob. 4PCh. 3.9 - Prob. 5PCh. 3.9 - Prob. 6PCh. 3.9 - Prob. 7PCh. 3.9 - Prob. 8PCh. 3.9 - Prob. 9PCh. 3.9 - Prob. 10PCh. 3.9 - Prob. 11PCh. 3.9 - Prob. 12PCh. 3.9 - Prob. 13PCh. 3.9 - Prob. 14PCh. 3.10 - Prob. 1PCh. 3.10 - Prob. 2PCh. 3.10 - Prob. 3PCh. 3.10 - Prob. 4PCh. 3.10 - Prob. 5PCh. 3.10 - Prob. 6PCh. 3.10 - Prob. 7PCh. 3.10 - Prob. 8PCh. 3.10 - Prob. 9PCh. 3.11 - Prob. 1PCh. 3.11 - Show that Finco’s objective function may also be...Ch. 3.11 - Prob. 3PCh. 3.11 - Prob. 4PCh. 3.11 - Prob. 7PCh. 3.11 - Prob. 8PCh. 3.11 - Prob. 9PCh. 3.12 - Prob. 2PCh. 3.12 - Prob. 3PCh. 3.12 - Prob. 4PCh. 3 - Prob. 1RPCh. 3 - Prob. 2RPCh. 3 - Prob. 3RPCh. 3 - Prob. 4RPCh. 3 - Prob. 5RPCh. 3 - Prob. 6RPCh. 3 - Prob. 7RPCh. 3 - Prob. 8RPCh. 3 - Prob. 9RPCh. 3 - Prob. 10RPCh. 3 - Prob. 11RPCh. 3 - Prob. 12RPCh. 3 - Prob. 13RPCh. 3 - Prob. 14RPCh. 3 - Prob. 15RPCh. 3 - Prob. 16RPCh. 3 - Prob. 17RPCh. 3 - Prob. 18RPCh. 3 - Prob. 19RPCh. 3 - Prob. 20RPCh. 3 - Prob. 21RPCh. 3 - Prob. 22RPCh. 3 - Prob. 23RPCh. 3 - Prob. 24RPCh. 3 - Prob. 25RPCh. 3 - Prob. 26RPCh. 3 - Prob. 27RPCh. 3 - Prob. 28RPCh. 3 - Prob. 29RPCh. 3 - Prob. 30RPCh. 3 - Graphically find all solutions to the following...Ch. 3 - Prob. 32RPCh. 3 - Prob. 33RPCh. 3 - Prob. 34RPCh. 3 - Prob. 35RPCh. 3 - Prob. 36RPCh. 3 - Prob. 37RPCh. 3 - Prob. 38RPCh. 3 - Prob. 39RPCh. 3 - Prob. 40RPCh. 3 - Prob. 41RPCh. 3 - Prob. 42RPCh. 3 - Prob. 43RPCh. 3 - Prob. 44RPCh. 3 - Prob. 45RPCh. 3 - Prob. 46RPCh. 3 - Prob. 47RPCh. 3 - Prob. 48RPCh. 3 - Prob. 49RPCh. 3 - Prob. 50RPCh. 3 - Prob. 51RPCh. 3 - Prob. 52RPCh. 3 - Prob. 53RPCh. 3 - Prob. 54RPCh. 3 - Prob. 56RPCh. 3 - Prob. 57RPCh. 3 - Prob. 58RPCh. 3 - Prob. 59RPCh. 3 - Prob. 60RPCh. 3 - Prob. 61RPCh. 3 - Prob. 62RPCh. 3 - Prob. 63RP
Knowledge Booster
Background pattern image
Recommended textbooks for you
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole