Scribd
Upload
74 views1 page

Final Exam Opeartion Research

This document provides instructions for a final exam in operations research. It lists 4 questions to be answered for the exam. Students have 1 day (24 hours) to complete the exam and must submit their answer sheet to the professor before January 14th at 3:00 pm. The questions cover topics such as linear programming, production planning, the simplex method, and discrete-time Markov chains.

Uploaded by

Allen Cost
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
74 views1 page

Final Exam Opeartion Research

This document provides instructions for a final exam in operations research. It lists 4 questions to be answered for the exam. Students have 1 day (24 hours) to complete the exam and must submit their answer sheet to the professor before January 14th at 3:00 pm. The questions cover topics such as linear programming, production planning, the simplex method, and discrete-time Markov chains.

Uploaded by

Allen Cost
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/ 1

FINAL EXAM OPEARTION RESEARCH

UNIVERSITAS NEGERI MANADO


FACULTY OF ENGINEERING
Daniel Riano Kaparang, S.Kom., M.Cs

Instructions:
a. You have 1x24 hour to answer the question below.
b. Use the answer sheet that I provided.
c. You can answer in Bahasa Indonesia.
d. You must collect the answer sheet at my office before Jan 14th 3:00 pm

1. Consider the following LP problem:


Minimize 2x1 +3x2
subject to the constraints
xi ≥ 0, i = 1,2, and
x1 + 2x2 ≥
4 x1 +x2 ≥ 3
a. Convert this problem to a maximization problem
b. Solve the problem of (a) by the graphical method

2. A manufacturer produces two types of plastic cladding. These have the trade names Ankalor and Beslite. One yard
of Ankalor requires 8 lb of polyamine, 2.5 lb of diurethane and 2 lb of monomer. A yard of Beslite needs 10 lb of
polyamine, 1 lb of diurethane, and 4 lb of monomer. The company has in stock 80,000 lb of polyamine, 20,000 lb of
diurethane, and 30,000 lb of monomer. Both plastics can be produced by alternate parameter settings of the
production plant, which is able to produce sheeting at the rate of 12 yards per hour. A total of 750 production plant
hours are available for the next planning period. The contribution to profit on Ankalor is $10/yard and on Beslite is
$20/yard. The company has a contract to deliver at least 3,000 yards of Ankalor. What production plan should be
implemented in order to maximize the contribution to the firm's profit from this product division?

3. Use the simplex method to solve the problem


Max Z = x1 +2x3
Sbj. x1 +2x2 +x3 ≤ 2
x3 ≤ 1
x1 ≥ 0,x2 ≥ 0,x3 ≥ 0.

4. Discrete-Time Markov Chains I: A baseball team consists of 2 stars, 13 starters, and 10 substitutes. For insurance
purposes, the team owner must place a value on the players. The value of each player is defined to be the total
value of the salary he will earn until retirement. At the beginning of each season, the players are classified into one
of four categories: Category 1: Substitute (earns $100,000 per year). Category 2: Starter (earns $400,000 per year).
Category 3: Star (earns $1 million per year). Category 4: Retired while not a star (earns no more salary). Category 5:
Retired while Star (earns no salary, but is paid $100,000/year for product endorsements). Given that a player is a
star, starter, or substitute at the beginning of the current season, the probabiliites that he will be a star, starter,
substitute, or retired at the beginning of the next season are shown in the transition probability matrix P below.
Also shown are a diagram of the Markov chain model of a "typical" player, several powers of P, the first-passage
probability matrices, the absorption probabilities, and the matrix of expected number of visits!

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy