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.8, Problem 11P

Explanation of Solution

 Formulation of a Linear Programming (LP) to determine the cheapest way of producing today’s batch of Rozac:

 In the given table, “A” be the pounds of ingredient “A” used, “B” be the pounds of ingredient “B” used, and “C” be the pounds of ingredient “C” used.

 Let “xi” be the pounds of chemical “i” used.

 The objective is to minimize the cost of production.

 z=(cost of chemical 1)(pounds of chemical 1)+(cost of chemical 2)(pounds of chemical 2)+(cost of chemical 3)(pounds of chemical 3)+(cost of chemical 4)(pounds of chemical 4)=8x1+10x2+11x3+14x4

 Therefore, the objective function is,

 z=8x1+10x2+11x3+14x4

 Constraint 1 to 3:

 Minimum ingredient A, B, C requirements for the drug.

 (pounds of ingredient A used)[(at least 8% of drug must contain A)×(total production of drug)]A(0.08)(1000)A80

 (pounds of ingredient A used)[(at least 4% of drug must contain B)×(total production of drug)]B(0

Blurred answer
Students have asked these similar questions
Pneumatics Engineering purchased a machine that had a fi rst cost of $40,000, an expected useful life of 8 years, a recovery period of 10 years, and a salvage value of $10,000. The operating cost of the machine is expected to be $15,000 per year. The inflation rate is 6% per year and the company’s MARR is 11% per year. Determine the depreciation charge for year 3 according to the straight line method. (UNITS ARE REQUIRED)
A certain grade of steel is graded according to the following condition:              1.      Hardness must be greater than 40   2.      Carbon contents must be less than 0.8   3.      Tensile strength must be greater than 5000   The grades are as follows:   §  Grade is 10 if all the three conditions are met.   §  Grade is 9 if conditions 1 and 2 are met.   §  Grade is 8 if conditions 2 and 3 are met.   §  Grade is 7 if conditions 1 and 3 are met.   §  Grade is 6 if only one condition is met.   §  Grade is 5 if none of the conditions are met.   Write a C++ program which will require user to give values of hardness, carbon content and tensile strength of the steel under consideration then determine the grade of steel and outputs the grade of the steel
4. An electronics company is engaged in the production of two components C, and C2, used in radio sets. Each unit of C costs the company 5 in wages and 5 in materials, while each unit of C2 costs the company 7 25 in wages and 15 in materials. The company sells both products on one-period credit terms, but the company's labour and material expenses must be paid in cash. The selling price of C, is 7 30 per unit and of C, it is 7 70. Because of the strong monopoly of the company for these components, it is assumed that the company can sell at the prevailing prices as many units as it produces. The company's production capacity is, however, limited by two considerations. First, at the beginning of period 1, the company has initial balance of 7 4,000 (cash plus bank credit plus collections from past credit sales). Secondly, the company has available, in each period, 2,000 hours of machine time and 1,400 hours of assembly time. The production of each C1 requires three hours of machine time…

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