goal programming, A farmer in the Midwest has 1,000 acres of land on which she intends to, Operation Research

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 established 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.

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages

goal programming, Operation Research

Related Discussions:- goal programming

Evolution, how did operation research evolve

Steps of research proposal, Steps of Research Proposal Proposal Con...

Linear programming, Use Big M method to Maximize(Z)=3_(x_1 )+2_(x_2 ) Subj...

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

Research essay, how Network Scheduling solving a real problem in a real bus...

Assingment MB0048 Q. No. 2, pls. send me solved ans. on my email :

Organization of the study, In this project the main focus is conducted inte...

Lpp linear programming problems exercise, Exercise Define the t...

Solve lpp by using its duality, Maximize w = 5x -2y +3z subject to 2x +2y -...

Linear programing problems, basic requirements for solving linear programin...

Write Your Message!

Featured Services

Online Tutoring

Project Development

Exam Preparation

Course Help

Assignment Help

Popular Subjects

Assured A++ Grade

Academics

Major Subjects

Majors

Get In Touch

TERMS & POLICIES

HELP & SUPPORT