Math Is Fun Forum

finitehelp

Member

Registered: 2009-06-21

Posts: 80

Linear Programming and probabilty

I took an online exam today and I could have gotten a B if only I knew how to answer the problems below. If there is anyone who knows how to answer them I would appreciate a little help and clarification.

Linear programming

1.A firm manufactures bumper bolts and fender bolts for antique cars. One machine can produce 130 fender bolts per hour, and another machine can produce 120 bumper bots per hour. The combined number of fender bolts and bumper bolt the packaging department can handle is 230 per hour.
** Write the inequalities that describe the constraints on the number of each type of bolt produced. Begin by identifying what x and y represent.

** How many corners does the feasible region have and what are they?

2.When using the simplex method to solve a linear programming problem how do you no that no maximum solution exists?

Probability

1.Give an example illustrating the difference between mutually exclusive events and independent events, and explain.

2.Create two problems with the solutions to one probability experiment involving mutually exclusive events and one involving independent events.

bobbym

bumpkin

From: Bumpkinland

Registered: 2009-04-12

Posts: 109,606

Re: Linear Programming and probabilty

Hi finitehelp;

For #2:

When you are using the simplex method on a LPP that is in standard form and all the entries in the tableau are 0 or negative, you will be unable to pick a pivot element. This means that the problem is unbounded or it has no maximum.

---

In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.

finitehelp

Member

Registered: 2009-06-21

Posts: 80

Re: Linear Programming and probabilty

Thanks bobbym. If anyone knows the others please feel free to post.

Fruityloop

Member

Registered: 2009-05-18

Posts: 143

Re: Linear Programming and probabilty

For #1.
Let x = # of fender bolts per hour.
Let y = # of bumper bolts per hour.
So the constraints are

The feasible region has 5 corners and they are (0,0) (0,120) (110,120) (130, 100) (130,0)

Last edited by Fruityloop (2009-07-06 06:17:16)