User Account

All Pages

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

Question, Solve the following Linear Programming Problem using Simple metho...

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

Simplex method, Solve the following Linear Programming Problem using Simple...

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

LPP., A constraints in an LPP restricts? (Value of objective function,Value...

A constraints in an LPP restricts? (Value of objective function,Value of decision variable,Use of available resources, uncertainty of optimum value) please help me to find out righ

Formulate this as a Linear Programming Problem., A paper mill produces two ...

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

Action phase - phase of operation research, The action phase consists of ...

The action phase consists of making recommendations for remedial action to those who first posed the problem and who control the operations directly. These recommendatio

Lpp, a paper mill prodecs two grades of paper viz., X and Y. Because of raw...

a paper mill prodecs 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 in

Operation Research.., 3. Explain ‘Vogel Approximation Model (VAM)’.? answer...

3. Explain ‘Vogel Approximation Model (VAM)’.? answer please

Models in operation research, models in operation research

models in operation research

Model, classification

classification

#title scope.., scope of the operation research in modern management?

scope of the operation research in modern management?

Write Your Message!

Captcha
Order Assignment

Featured Services

Order Now

Popular Subjects

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!

Submit Assignment

Academics

Major Subjects

Majors

Get In Touch

whatsapp: +91-977-207-8620

Phone: +91-977-207-8620

Email: [email protected]

TERMS & POLICIES

HELP & SUPPORT

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