Project Description:

egmt 410 - operations research -

1. determine the root of the following equation using the newton-raphson method with an initial

guess of x = 1. show two iterations.

hint if then , and

if then .

2. solve the following model using the simplex method. show all the steps for each iteration

and clearly state the values for each of the variables (objective value, decisions variables, and

slack variable) for each iteration. be sure to clearly show the final answer to the problem.

maximize z = 2x1 + 1x2

subject to:

1x1 + 1x2 ≤ 12

10x1 + 1x2 ≤ 30

and

x1, x2 ≥ 0

3. you have decided to enter the candy business. you are considering producing two types of

candies: slugger candy and easy out candy, both of which consist solely of sugar, nuts, and

chocolate. at present, you have in stock 100 oz of sugar, 20 oz of nuts, and 30 oz of chocolate.

the mixture used to make easy out candy must contain at least 20% nuts. the mixture used to

make slugger candy must contain at least 10% nuts and 10% chocolate. each ounce of easy

out candy can be sold for 25 cents, and each ounce of slugger candy for 20 cents. formulate

an lp that will enable you to maximize your revenue from candy sales.

formulate a linear programming model for this problem by:

1. listing and labeling all of the decision variables.

2. creating an objective function for the model.

3. list all of the constraints for the model.

i want a complete linear programming model, however you do not have to provide the answers

to the model.
Skills Required:
Project Stats:

Price Type: Negotiable

Completed
Total Proposals: 9
1 Current viewersl
44 Total views
Project posted by:

Proposals

Proposals Reputation Price offered