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

Meaning of critical, meaning of critical activity ..

meaning of critical activity ..

Linear programmimg, #questionA paper mill produces two grades of paper viz....

#questionA 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 grad

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

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

Lp, #question.Solve the following Linear Programming Problem using Simple m...

#question.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, Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4...

Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4x + 8y >= 5

De, describe the similarities and differences of transportation and linear ...

describe the similarities and differences of transportation and linear programing methods

Linear programming simplex method, How to solve linear programming problems...

How to solve linear programming problems using simplex method introducing slack variable,surplus variable and artificial variable

Help me please , This year Jan Rich, who is ranked number one in women''s s...

This year Jan Rich, who is ranked number one in women''s singles in tennis, and Marie Wacker, who is ranked number three, will play 4 times. If Marie can beat Jan 3 times, she will

Mip, procedure of mip

procedure of mip

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