Scribd
Upload
88 views4 pages

Frank H. Dotterweich College of Engineering Department of Mechanical and Industrial Engineering

This document contains an exam for a linear programming course. It consists of 4 multiple choice questions regarding linear programming models, including graphing feasible regions, finding corner point solutions, converting problems to standard form, and setting up initial simplex tables. The last question asks students to build a linear programming model for a scenario involving a furniture maker producing two types of cabinets with constraints on materials budget and labor hours.

Uploaded by

Soumojit Kumar
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
88 views4 pages

Frank H. Dotterweich College of Engineering Department of Mechanical and Industrial Engineering

This document contains an exam for a linear programming course. It consists of 4 multiple choice questions regarding linear programming models, including graphing feasible regions, finding corner point solutions, converting problems to standard form, and setting up initial simplex tables. The last question asks students to build a linear programming model for a scenario involving a furniture maker producing two types of cabinets with constraints on materials budget and labor hours.

Uploaded by

Soumojit Kumar
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

TEXAS A&M UNIVERSITY-KINGSVILLE

Frank H. Dotterweich College of Engineering


Department of Mechanical and Industrial Engineering

IEEN 5335 – Optimization


Exam No. 1

Name: ___________________________________________________ Date: _______________


Last First

K#: _________________________________________

Note: To get a full credit for each question, write as precise as the questions ask for.

1. Consider the following linear program.

Max 2x1 + x2
s.t. 3x1 + 6x2 ≤ 30
5x1 + x2 ≤ 10
3x1 - x2 ≥ 1
x1, x2 ≥ 0

a) Graph the feasible set.

b) Find all corner point feasible solutions and the optimal solution.

1
2. Consider the following linear program.

Max 3x1 + 7x2


s.t. 2x1 + x2 ≤ 6
4x1 + 5x2 ≤ 20
2x1 ≥ 7
2x2 ≤ 7
x1, x2 ≥ 0

a) Use Graphical method to show that this problem is infeasible.

b) How would you “fix” this problem so that the problem can be solved? Show one possible way
to fix this problem.

2
3. Consider the following linear program.

Max 2x1 + x2
s.t. 3x1 + 6x2 ≤ 30
5x1 + x2 ≤ 10
x1, x2 ≥ 0

a) Write the problem in standard form.

b) Set up the initial tableau for the simplex method. Check if the initial tableau is optimal or not.
If it is not optimal, find entering variable and leaving variable.

3
4. Build a LP model for the following scenario, but don’t need to solve the LP model you made.

A furniture cabinet maker produces two types of cabinets. The Mission-style cabinet requires
$340 in materials and 15 labor hours to produce and it yields a profit of $910 per cabinet. The
Rustic-style cabinet requires $430 in materials and 20 hours to produce, and it yields a profit of
$1,200. The firm has a budget of $30,000 to spend on materials. To ensure full employment, the
firm wishes to keep all 30 workers fully employed, so all 1,200 available labor hours must be
used. What is the best combination of furniture cabinets to be made?

First of all, define the decision variables, and then write objective function and constraints.

You might also like