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

Rank methods spearman s, Rank Methods Spearman s When the variables  u...

Rank Methods Spearman s When the variables  under  consideration are  not capable  of quantitative  measurement but can  be arranged  in serial  order( ranks) we find  correla

Problems based on lpp when feasible region is a line segment, Problems base...

Problems based on LPP when feasible region is a line segment or it does not exist. 1.    Maximize z = 2x+3y subject to the constraints X + y ≤ 1 X + y ≥ 3 X,  y ≥ 0

Find out where you should now invest your money, Question : Suppose tha...

Question : Suppose that you want to invest $10000 in the stock market by buying shares in one of two companies: A and B. Shares in Company A are risky but could yield a 50% ret

Model building, model building is the essence of the operational research d...

model building is the essence of the operational research discuss

C++ programs, C++ code for assignment problem

C++ code for assignment problem

North west corner rule, North West Corner Rule for Initial Solution: Now ...

North West Corner Rule for Initial Solution: Now by applying North West corner rule we can initial solution. According to this rule without regard to cost consideration the

Determine the best age at which to replace the machine, Question: Machi...

Question: Machine A costs Rs. 9000. Annual operating costs are Rs. 200 for the first year, and then increase by Rs. 2000 every year. Suppose that the machine has no resale valu

Simplex method, how to solve simplex method in LPP?

how to solve simplex method in LPP?

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