Scribd
Upload
787 views4 pages

Finals Smath

The document contains 16 multiple choice or short answer questions related to linear programming concepts. Some questions ask the reader to identify objective functions, constraints, feasible regions, or optimal solutions for sample linear programming problems. Other questions test understanding of key linear programming terms and properties, such as decision variables, alternative optimal solutions, and the definition of a linear programming problem.

Uploaded by

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

Finals Smath

The document contains 16 multiple choice or short answer questions related to linear programming concepts. Some questions ask the reader to identify objective functions, constraints, feasible regions, or optimal solutions for sample linear programming problems. Other questions test understanding of key linear programming terms and properties, such as decision variables, alternative optimal solutions, and the definition of a linear programming problem.

Uploaded by

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

1. What are the things you like to suggest/comment to improve online learning or online teaching?

There are number of things I want to suggest on how to improve online learning and teaching.
First, for online learning, it is better if the answer keys for laboratory works and enabling
assessments will be given to students so that we will have an idea where we got the wrong
answer and will also have an idea on how it should be done properly next time. Another would
for the lessons, it is better if lessons will be unlocked so that we can do readings on our
convenient time. On the other hand, for online teaching, I think it would be nice if professors
will not bombard students with a lot of assessments since students have a lot of subjects.
Personally, I get stressed with the numerous assessments we have, and it affects my
understanding of the lessons.
2. Which of the following is NOT a property of all linear programming problems?
a. A linear objective function that is to be maximized or minimized
b. Variables that are all restricted to nonnegative values
c. Alternative optimal solutions
d. A set of linear constraints
3. In a linear programming problem, the objective function and the constraints must be linear
functions of the decision variables.
a. True
b. False
4. Which of the following statements correctly describe what is the maximization or minimization
of a quantity is for?
a. Decision for decision analysis
b. Constraints of operations research
c. Objective of linear programming
d. Goal of management science
5. How to find the optimal solution to a linear programming problem using the graphical method?
a. Find the feasible point that is the farthest away from the origin
b. Find the feasible point that is closest to the origin
c. Find the feasible point that is at the highest location
d. None of the alternatives is correct
6. All linear programming problems have all of the following properties EXCEPT
a. A linear objective function that is to be maximized or minimized
b. Variables that are all restricted to nonnegative values
c. Alternative optimal solutions
d. A set of linear constraints
7. Which of the following is a valid objective function for a linear programming problem?
a. Max5x2+6y2
b. Max 5xy
c. Min (x1+x2)/x3
d. Min 4x+3y + (2/3)z
8. There is a small company in Melbourne which has recently become engaged in the production
of office furniture. The company manufactures tables, desks and chairs.
The production of a table requires 8 kilograms of wood and 5 kilograms of metal and is sold for
80 dollars; a desk uses 6 kilograms of wood and 4 kilograms of metal and is sold for 60 dollars;
and a chair requires 4 kilograms of both metal and wood and is sold for 50 dollars. Determine
the revenue maximizing strategy for this company, given that their resources are limited to 100
kilograms of wood and 60 kilograms of metal.
Attached necessary solution to the given problem.
Clearly indicate your answer on the following questions:
What is the objective function of the given problem?
What are the constraints of the given problem?
What is the optimal solution?
How much is the maximum revenue?
9. August assembles stereo equipment for resale in his shop. He offers two products, turntables,
and cassette players. He makes a profit of P100 on each turntable and P60 on each cassette.
Both must go through two steps in his shop – assembly and bench checking. A turntable takes
12 hours to assemble and 4 hours to bench check. A cassette player takes 4 hours to assemble
but 8 hours to bench check. Looking at this month’s schedule, August sees that he has 60
assembly hours uncommitted and 40 hours of bench-checking time available.

Which of the following CANNOT be a constraint of the above problem?


a. 4T+8C<=40
b. T<=0
c. 12T+4C<=60
d. C>=0
What is the objective function of the given problem?
a. Max Prof = 100T+60C
b. Max Loss = 100T+60C
c. Max Prof = 60T+100C
d. Min Loss = 60T+100C
e. Min Loss = 100T+60C
f. Min Prof = 100T+60C
10. Objective Function: Maximize: Z =  20X + 10Y
subject to:
12X + 15Y <= 180
15X + 10Y <= 150
3X  -  8Y  <= 0
X,Y >= 0
Which area forms the feasible region?
a. I
b. II
c. III
d. IV
e. V
f. VI
g. VII

Which point gives the optimal solution?


a. A
b. B
c. C
d. D
e. E
f. F
g. G

11. Consider the following statements:


I. In a linear programming problem, the objective function and the constraints must be linear
functions of the decision variables.
II. Decision variables limit the degree to which the objective in a linear programming problem is
satisfied.
Which of the following is/are TRUE?
a. Statement I is true, Statement II is false
b. Statement I is false, Statement II is true
c. Both statements are true
d. Neither of the statements is true
12. Consider the statements:
I. An optimal solution to a linear programming problem can be found at an extreme point of the
feasible region for the problem.
II. The constraint 5x1 - 2x2 <= 0 passes through the point (20, 50).
Which of the following is/are TRUE?
a. Statement I is true, Statement II is false
b. Statement I is false, Statement II is true
c. Both statements are true
d. Neither of the statements is true
13. Muir Manufacturing produces two popular grades of commercial carpeting among its many
other products.
In the coming production period, Muir needs to decide how many rolls of each grade should be
produced in order to maximize profit.
Each roll of Grade X carpet uses 50 units of synthetic fiber, requires 25 hours of production time,
and needs 20 units of foam backing.
Each roll of Grade Y carpet uses 40 units of synthetic fiber, requires 28 hours of production time,
and needs 15 units of foam backing.
The profit per roll of Grade X carpet is 200 dollars and the profit per roll of Grade Y carpet is 160
dollars.
In the coming production period, Muir has 3000 units of synthetic fiber available for use.
Workers have been scheduled to provide at least 1800 hours of production time (overtime is a
possibility).
The company has 1500 units of foam backing available for use.

Attached solution to the given problem.


Clearly indicate your answer on the following questions:
What is the objective function of the given problem?
What are the constraints of the given problem?
Use graphical solution and clearly label the feasible region within the graph.
What are the feasible points?
What is the optimal solution?
How many rolls of each grade should be produced in order to maximize profit?
14. Which of the following statements correctly describes what is Decision Variable?
a. Must exist for each constraint
b. Represent the values of the constraints
c. Tell how much or how many of something to produce, invest, purchase, hire, etc.
d. Measure the objective function
15. Find the complete optimal solution to this linear programming problem.
Objective Function: Minimize: C = 3X + 3Y
Subject to constraints:
12X+4Y.=48
10X+5Y>=50
4X+8Y>=32
X,Y.=0
Attach a file
16. A manufacturer of plastics is planning to blend a new product from four chemical compounds.
These compounds are mainly composed of three elements: A, B, and C. The composition and
unit cost of these chemicals are shown in the following table:

Chemical
1 2 3 4
Compound
Percentage A 35 15 35 25
Percentage B 20 65 35 40
Percentage C 40 15 25 30
Cost/kilogram 20 30 20 15
The new product consists of at least 25 percent element A, at least 35 percent element B, and at
least 20 percent element C.

Owing to side effects of compounds 1 and 2, they must not exceed 25 percent and 30 percent
respectively, of the content of the new product.

Formulate the problem of finding the least costly way of blending as a linear program.

Attached necessary solution to the given problem.


Clearly indicate your answer on the following questions:
What is the objective function of the given problem?
What are the constraints of the given problem?
what is the optimal solution?
how much is the minimum cost?

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