goal programming, Operation Research

Assignment Help:
A farmer in the Midwest has 1,000 acres of land on which she intends to plant corn, wheat, and

soybeans. Each acre of corn costs $100 for preparation, requires 7 worker-days of labor, and yields a

profit of $30. An acre of wheat costs $120 to prepare, requires IO worker-days of labor, and yields $40

profit. An acre of soybeans costs $70 to prepare, requires 8 worker-days, and yields $20 profit. The

farmer has taken out a loan of $80,000 for crop preparation and has contracted with a union for 6,000

worker-days of labor. A midwestern granary has agreed to purchase 200 acres of corn, 500 acres of

wheat, and 300 acres of soybeans. The farmer has estab­lished the following goals, in order of their

importance:

(I) To maintain good relations with the union, the labor contract must be honored; that is, the full

6,000 worker-days of labor contracted for must be used.

(2) Preparation costs should not exceed the loan amount so that additional loans will not have to be

secured.

(3) The farmer desires a profit of at least $105,000 to remain in good financial condition.

(4) Contracting for excess labor should be avoided.

(5) The farmer would like to use as much of the available acreage as possible.

(6) The farmer would like to meet the sales agreement with the granary. However, the goal should

be weighted according to the profit returned by each crop.

a. Formulate a goal programming model to determine the number of acres of each crop the farmer

should plant to satisfy the goals in the best possible way.

b. Solve this model by using the computer.

Related Discussions:- goal programming

Linear programming problem, A paper mill produces two grades of paper viz.,...

A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper i

Linear programming problem, #Solve the following Linear Programming Problem...

#Solve the following Linear Programming Problem using Simplex method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Integer programming, An integer programming problem is identical to a linea...

An integer programming problem is identical to a linear programming problem except that one or more decision variables are constrained to take integer values. Such problems cannot

Binomial distriubiton - probability distribution , BINOMIAL DISTRIUBITON ...

BINOMIAL DISTRIUBITON This  distribution  (also known  as Bernoulli  distribution ) is useful  in such  an experiment where  there  are only two  outcomes success or failure g

Assignment 2012, Problem 1 (Problem 23, page 507) At a machine tool plant, ...

Problem 1 (Problem 23, page 507) At a machine tool plant, five jobs must be completed each day. The time it takes to do each job depends on the machine used to do the job. If a mac

Sequential sampling -sampling decisons, Sequential Samplin The previou...

Sequential Samplin The previous  has shown  that the sampling  units  were drawn  prior  to the drawing of the actual   sample  and has  a fixed  size. But the  sequential  sa

Answer, A paper mill produces two grades of paper viz., X and Y. Because of...

A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper i

Uses of mode - measure of central tendency, Uses of Mode The  use of t...

Uses of Mode The  use of the mode is recommended in the following  situations: a.When a quick  and approximate measures of  central tendency desired. b.When the  measure

Operation Research, Significance & scope of operation research in modern ma...

Significance & scope of operation research in modern management

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd