Consider the following integer programming problem. Solve it using the branch and bound method. What are the optimal values of x1, x2, and Z?
Maximize Z = 2x1 + x2
Subject to: 2x1 + 2x2 ? 7
4x1 + x2 ? 11
x1 and x2 ? 0
A) x1 = 1, x2 = 2, Z = 4
B) x1 = 2, x2 = 1, Z = 5
C) x1 = 1, x2 = 1, Z = 3
D) x1 = 0, x2 = 3, Z = 3
E) x1 = 2, x2 = 2, Z = 6
Answer: B
You might also like to view...
A legally enforced part of a loan contract that requires the borrower to act in a certain way or to use the borrowed funds for a particular purpose is known as
A. collateral. B. a net worth requirement. C. a covenant. D. a clause.
Shoichiro Toyoda, former president of Toyota Motors, built on Ford’s concepts and focused on the need to eliminate waste from the production system. He followed a(n) _____ approach.
A. assembly line B. distribution C. lean production D. synchronous production
In a resource-constrained project the third priority in assigning resources is usually given to activities with the
A. Lowest identification number. B. Smallest duration. C. Least slack. D. Most slack. E. Highest cost.
Gleaming Gem Corporation agrees to sell Jewelry Outlets, Inc. (JOI), fifty new diamonds, but the contract does not specify a place of delivery. JOI is expected to pick up the goods. The place of delivery is
A. Gleaming's place of business. B. JOI's place of business. C. the Annual Gems and Jewels Convention. D. the U.S. Postal Service office nearest to JOI's place of business.