Scribd
Upload
63 views4 pages

Practice Questions

Uploaded by

Muhammad Usman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
63 views4 pages

Practice Questions

Uploaded by

Muhammad Usman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Q1) The Chris Beehner Company manufactures two lines of designer yard gates, called model A

and model B. Every gate requires blending a certain amount of steel and zinc; the company has
available a total of 25,000 lb of steel and 6,000 lb of zinc. Each model A gate requires a mixture
of 125 lb of steel and 20 lb of zinc, and each yields a profit of $90. Each model B gate requires
100 lb of steel and 30 lb of zinc and can be sold for a profit of $70. Find by graphical linear
programming the best production mix of yard gates

Q2) The Lifang Wu Corporation manufactures two models of industrial robots, the Alpha 1 and
the Beta 2. The firm employs 5 technicians, working 160 hours each per month, on its assembly
line. Management insists that full employment (that is, all 160 hours of time) be maintained for
each worker during next month’s operations. It requires 20 labor-hours to assemble each Alpha
1 robot and 25 labor-hours to assemble each Beta 2 model. Wu wants to see at least 10 Alpha
1s and at least 15 Beta 2s produced during the production period. Alpha 1s generate a $1,200
profit per unit, and Beta 2s yield $1,800 each. Determine the most profitable number of each
model of robot to produce during the coming month

Q3)

A) Solve the above problem by simplex method


B) Convert the problem in to dual and solve by graphical method

Q4) For the following LP problem

Zp= 3x1 + 5x2

S.t

2X1 + 3X2 ≤ 8

X1 + 2X2 ≤ 5

a) Solve the problem by graphical method


b) Solve the problem by simplex method
c) Covert the problem into dual and solve by graphical method
Q5)

Q6)
Q7)
Q8)

You might also like