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 14RP

Explanation of Solution

LP Formulation:

  • Given data:
MethodGrade 6Grade 8Grade 10Cost ($)

1

2

0.2

0.3

0.2

0.3

0.6

0.4

3.40

3.00

30.40.40.22.60
  • Let Wa,Wb,Aa and Ab be the pounds of wheat and alfalfa used to produce feed sold at discount price.
  • Let W1,W2,A1 and A2 be the pounds of wheat and alfalfa used to produce feed sold at non-discounted price.
  • The objective is to maximize Feedco’s profit.
  • Profit = (cost/lb) (pounds of wheat and alfalfa feed 1 sold at non-discounted price) + (cost/lb) (pounds of wheat and alfalfa feed 2 sold at non-discounted price) + (cost/lb) (pounds of wheat and alfalfa feed 1 sold at discounted price) + (cost/lb) (pounds of wheat and alfalfa feed 2 sold at discounted price) – (cost/lb) (total pounds of wheat purchased) – (cost/lb) (total pounds of alfalfa purchased)
  • Profit= 1.5(W1+A1)+1.3(W2+A2)+1.25(Wa+Aa)+1(Wb+Ab)0.5(W1+W2+Wa+Wb)0.4(A1+A2+Aa+Ab)
  • Thus, the objective function is,
  • Maximize
  • z= 1.5(W1+A1)+1.3(W2+A2)+1.25(Wa+Aa)+1(Wb+Ab)0.5(W1+W2+Wa+Wb)0.4(A1+A2+Aa+Ab)
  • The following constraints are,
  • Constraints 1: At most, 300lb of feed 1 can be sold.
  • (Pounds of wheat produce feed 1) + (Pounds of alfalfa produce feed 1) ≤300
    • Wa+Aa300
  • Constraint 2: At most, 300lb of feed 1 can be sold.
  • (Pounds of wheat produce feed 2) + (Pounds of alfalfa produce feed 2) ≤300
    • Wb+Ab300
  • Constraint 3: At most, 1000lb of wheat can be purchased.
  • (Pounds of wheat used to produce feed 1) + (Pounds of wheat used to produce feed 2) ≤1000
    • W1+W2+Wa+Wb1000
  • Constraint 4: At most, 800lb of alfalfa can be purchased

Blurred answer
Students have asked these similar questions
Vandelay Industries has 275 sales reps in order to sell its latex products, each to be assigned to one of four marketing teams. If the first team is to have four times as many members as the second team and the third team is to have five times as many members as the fourth team, how can the members be distributed among the teams?
A call center has 60 employees on‐line, each of whom make one phone call every 3 min on average, and talk on average for 2 min. Each call costs 15¢. What is the total traffic in erlangs? How many circuits are required for a GoS of 1%? How much should the yearly (250 working days, 8 working hours a day) lease price be for the company to make a 50% saving in its telephone bills over the first 3 years? Assume the lease set‐up fee of $30,000 should be paid over a period of 3 years.
Consider the following model of trade between Home and Foreign. Assume throughout that those two countries are the only two countries in the world, at least for purposes of trade. There are two goods: Corn and Radio. Consumers always spend one-third of their income on Corn and the remainder on Radios. The only factor of production is labour. Each home country worker can produce 2 units of Corn or 3 units of Radios per unit of time, while each foreign worker can produce 2 units of Corn or 4 units of Radios per unit of time. There are 30 workers in Home and 60 workers in Foreign. Draw the production possibility frontier for each country (put Corn on the vertical axis and Radios on the horizontal axis).

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
Recommended textbooks for you
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole