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.14, Problem 3P

Explanation of Solution

Formulation of LP to minimize Steelco’s costs:

From the information given, observe that during the next 3 months, steeco faces has three demands for steel.

Consider the following terms:

ix=Tons of steel in inventory at the end of month “t”.

px=Tons of steel produced in month “t”.

wx=Workers employed during month “t”.

z=Cost of satisfy demand.

Now, the one can write the following equations,

ix=il'il''xx=xl'xl''

Here,

il'=Tons of steel left in inventory at the end of month “t”.

il''=Tons of steel demanded after all inventory used up in month “t”.

xl=Change of number of workers from month “(l-1)” to month “t”.

xl'=Workers hired at the start of month “t”.

xl''=Workers fired at the start of the month “t”.

Objective function:

The objective function as follows,

Minimize

z=300(p1+p2+p3)+100(i1x+i2x+i31)+70(i1''+i2''+i3'')+5000(w1+w2+w3)++3000(x1''+x2''+x3'')+4000(x1'+x2'+x3')

Subject to the constraints,

i1=i1'i1''[invento</

Blurred answer
Students have asked these similar questions
At the beginning of month 1, Finco has $400 in cash.  At the beginning of months 1, 2, 3, and 4, Finco receives certain revenues, after which it pays bills (see Table 2 below).  Any money left over may be invested for one month at the interest rate of 0.1% per month; for two months at 0.5% per month; for three months at 1% per month; or for four months at 2% per month.  Use linear programming to determine an investment strategy that maximizes cash on hand at the beginning of month 5.  Formulate an LP to maximize Finco’s profit.
ACE Hardware wants to develop a daily schedule for its employees in one of its stores in Omaha. Currently,this store has five employees and the store is opened from 12pm to 9pm. The store must always have at leasttwo people on hand. Each employee must work at least four hours and no more than eight hours per day.Employee #1 goes to school and cannot start before 4pm while all other employees can work at any time.Furthermore, employee #1 earns $10 per hour while all other employees earn $12 per hour. Because all fiveemployees live so close to the store, you must assume that they do not need to work consecutive hours.a) Formulate an optimization model for this problem.b) Solve the optimization model using either the Microsoft Excel Solver or the IBM ILOG CPLEXOptimization Studio.
The Livewright Medical Supplies Company has a total of 12 salespeople it wants to assign to three regions-the South, the East, and the Midwest. A salesperson in the South earns $600 in profit per month for the company, a salesperson in the East earns $540, and a salesperson in the Midwest earns $375. The southern region can have a maximum assignment of five sales- people. The company has a total of $750 per day available for expenses for all 12 salespeople. A salesperson in the South has average expenses of $80 per day, a salesperson in the East has average expenses of $70 per day, and a salesperson in the Midwest has average daily expenses of $50. The company wants to determine the number of salespeople to assign to each region to maximize profit. a. Formulate an integer programming model for this problem. b. Solve this model by using the computer.

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