Introduction to mathematical programming
Introduction to mathematical programming
4th Edition
ISBN: 9780534359645
Author: Jeffrey B. Goldberg
Publisher: Cengage Learning
Expert Solution & Answer
Book Icon
Chapter 3, Problem 8RP

Explanation of Solution

Linear Programming (LP) formulation:

  • Given table:
 Steel 1Steel 2
MillCostTime (Minute)CostTime (Minute)
1$1020$1122
2$1224$918
3$1428$1030
  • Consider that xij be the tons of steel “i” manufactures at steel mill “j”, for (i=1,2 and j=1,2,3).
  • The objective is to minimize the cost of manufacturing desired steel.
    • z= ((cost of manufacturing) (tons of steel 1 manufactured in mill 1,2 and 3) + (cost of manufacturing) (tons of steel 2 manufactured in mill 1,2 and 3)
  • Thus the objective function is,
    • Min z= 10x11+12x12+14x13+11x21+9x22+10x23

Constraint 1:

  • At least, 500 tons of steel 1 must be produced each month
  • [tons of steel 1 produced in mill 1+tons of steel 1 produced in mill 2+ tons of steel 1 produced in mill 3]≥500
  • That is, x11+x12+x13500

Constraint 2:

  • At least, 600 tons of steel 2 must be produced each month
  • [tons of steel 2 produced in mill 1+tons of steel 2 produced in mill 2+ tons of steel 2 produced in mill 3]≥600
  • That is, x21+x22+x23600

Constraint 3:

  • At most, 200 hours of blast furnace time are available in each mill 1.
  • [(time required in mill 1) (tons of steel 1 produced in mill 1)+(time required in mill 1) (tons of steel 2 produced in mill1)]≤200
  • That is,

20x11+22x2120020x11+22x21200(60)20x11+22x2112000

Constraint 4:

  • At most, 200 hours of blast furnace time are available in each mill 2.
  • [(time required in mill 2) (tons of steel 1 produced in mill 2)+(time required in mill 2) (tons of steel 2 produced in mill2)]≤200
  • That is,

24x12+18x2220024x12+18x22200(60)24x12+22x2212000

Constraint 5:

  • At most, 200 hours of blast furnace time are available in each mill 3

Blurred answer
Students have asked these similar questions
Consider the following Scenario the Modeling of which you have completed in Assignment1: The Ministry of XYZ is the government body in the in charge of religious affairs. The application for Hajj is submitted to the hajj directorate, part of XYZ Ministry. Initial documents are submitted to the hajj directorate for registration. Documents are checked and verified by the Assistant Registration Officer. There are two categories of applicants based on their nationality. Specified percentage of seats are fixed for locals and other nationals. A unique registration number is issued to each applicant by the Assistant Registration Officer. After the completion of registration process, each applicant is asked to submit the detailed documentation which includes passport, vaccination certificate, medical certificate, receipts of payments. One Additional document (permission letter from home country) is needed for other national. Payments can be made through cash or card. Assistant Registration…
The WIX Company Civil Engineers consists of two divisions. The divisions are Water and Waste Water. The company sells engineering services to various customers. The following are the bill rates for the various staff classifications: Vice President $200/hour Senior Engineer $180/hour Staff Engineer $150/hour. The two divisions expect to bill the following hours: Water- 10000 hours, vice president at 10% of the time, 30% of Senior Engineer time and remaining to Staff Engineers. Waste Water- 6000 hours, vice president at 20% of the time, 20% of Senior Engineer time and remaining to Staff Engineers. The Direct Labor costs per hours are as follows: Vice President $80/hour Senior Engineer $60/hour Staff Engineer $40/hour. The utilization for each staff members are as follows: Vice President 60% Senior Engineer 80% Staff Engineer 90%. The company has the following other costs: Admin Salaries $90,000 Rent $100,000 Utilities $6,000 Benefits $76,000 Assume 20% of time for each staff member…
Compute the volumes of cut and fill between stations 88+30 to 88+68 using the slope stake notes in the table on the following page. Use the average end area equation except for when the section produces a pyramid. In those situations, use the equation for a pyramid. Assume: Base Widths: cut = 50 ft; fill = 40 ft | Side Slopes: 2:1 | Gradient: -2% SURFACE GRADE STA L CL R ELEV. (ft) ELEV. (ft) C18.1 C10.2 92+00 891.6 874.63 C17.0 61.2 45.4 0 0 0 0 91+52 8575.6 875.59 0.0 25 20 20 25 F6.9 F11.4 91+00 864.5 876.63 F12.1 33.8 42.8 F8.2 F10.1 90+50 867.3 877.63 F10.3 36.4 40.2 F12.8 90+05 875.3 878.53 F3.2 20 45.6 C16.3 F12.2 89+73 879.2 879.17 57.6 44.4 C17.4 F8.3 89+59 885.6 879.45 C6.1 59.8 14 36.6 C10.2 F7.3 89+43 879.8 879.77 45.4 34.6 F16.1 89+08 873.7 880.47 F6.8 20 52.2 C16.8 F12.9 88+68 881.3 881.27 58.6 45.8 C24.0 88+30 890.9 882.03 C8.9 73.0 25

Chapter 3 Solutions

Introduction to mathematical programming

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 Fincos 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 - Prob. 31RPCh. 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
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