Scribd
Upload
32 views

Midterm Exam Practice

Uploaded by

Moon 3111
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
32 views

Midterm Exam Practice

Uploaded by

Moon 3111
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

IEDA 3010 – Midterm Exam Practice

QUESTION 1 (30 points).


A company produces two kinds of products. A product of the first type requires 1 hour
of assembly labor, 1 hour of testing. A product of the second type requires 2 hours of
assembly, 3 hours of testing. Given the company’s current personnel, there can be at
most 80 hours of assembly labor and 90 hours of testing daily. Products of the first and
second type have a profit of 2 HKD and 5 HKD respectively.
(a) (10 points) Formulate a linear programming problem that can be used to maximize
the daily profit of the company.
(b) (8 points) Use the graphical method by hand to solve the problem.
(c) (6 points) Due to commercial competition, the profit for the first type product
remains unchanged, but the profit for the second type product drops from 5 HKD
to 4 HKD. What are the optimal solutions?
(d) (6 points) Suppose that the profit for the first type product remains unchanged while
the profit for the second type product changes from 5 HKD to 𝑥 HKD (𝑥 is a
parameter). Determine the range of x such that the solution you derive in problem
(b) is still optimal here.
QUESTION 2 (20 points).
Suppose you are operating a bank in the HKUST. Your bank provides four different
services which are bank account opening, credit card application, money
saving/retrieving, and general inquiries. Each case of bank account opening requires 60
minutes from the front desk clerk and 30 minutes from the printer. Each case of credit
card application requires 10 minutes from the front desk clerk and 20 minutes from the
printer. Each case of money saving/retrieving requires 20 minutes from the front desk
clerk and 20 minutes from the printer. Each case of general inquiry requires 10 minutes
from the front desk clerk and 5 minutes from the printer. The front desk clerk and printer
have 1000 minutes and 800 minutes available per day, respectively. The bank can earn
$360, $180, $120, and $40 from each case of bank account opening, credit card
application, money saving/retrieving, and general inquiries, respectively. How would
you determine the mix of your service production quantities that could maximize the
profit for a day?
(a) (7 points) Formulate an LP model for this problem.
(b) (13 points) Construct its dual problem. Find the optimal solutions for both the
primal and dual problems.
QUESTION 3 (30 points).
Suppose you will develop five new nutritious foods to sell in Hong Kong. You would
like to know which food and how many should be produced to maximize your
production's profit. The following table shows the development cost (set-up cost), units
of material required to produce each food unit, and revenue for each nutritious food.

(a) (8 points) We only have 500,000 units of materials. The production amount should
be an integer. Formulate an IP model for this problem.
(b) (12 points) We have the following restrictions. The total development cost must be
at most $200,000. At most, four products can be produced. We can produce Product
4 only if we have produced either Product 1 or 2. We can produce Product 5 only if
we have produced either Product 2 or 3. Suppose now the amount of each kind of
food produced must be an integral multiple of 0.5 (Assume selling half unit of a
product receives half the amount of profit per unit). Reformulate the IP model.
(c) (10 points) Suppose we DO NOT consider the developing cost and revenue in the
above table and the restrictions. We have a new table showing the profit we can gain
from each production level of the nutritious food. At most 6 thousand units of food
can be produced. We should determine the production level of each food before we
start the production. Formulate a BIP model for this problem.
QUESTION 4 (20 points).
(a) T F Linear programming problems can have multiple optimal
solutions.

(b) T F If a linear programming problem has two different optimal


solutions, it must have infinitely many optimal solutions.

(c) T F The optimal solution always changes when the constraint quantity
(𝑏$ ) changes.

(d) T F For a standard-form linear programming problem with 𝑛


decision variables and 𝑚 constraints, there are 𝑚 + 𝑛 equations
in complementary slackness.

(e) T F The dual of the dual problem is the original primal problem.

(f) T F All the decision variables of a mixed integer programming


problem are integer or binary-valued.

(g) T F To represent the “K out of N constraints must hold” relationship,


we can add N extra binary variables.

(h) T F The number of feasible solutions to an integer programming


problem must be finite.

You might also like