Purchase Solution

Linear programming

Not what you're looking for?

Ask Custom Question

Consider the following linear programming problem:

Min x1 + 2x2
s.t.
x1 + 4x2 ≤ 21
2x1 + x2 ≥ 7
3x1 +1.5x2 ≤ 21
-2x1 + 6x2 ≥ 0
x1, x2 ≥ 0

a. Find the optimal solution using the graphical solution procedure and the value of the objective function.

b. Determine the amount of slack or surplus for each constraint.

c. Suppose the objective function is changed to max 5x1 + 2x2. Find the optimal solution and the value of the objective function.

Purchase this Solution

Purchase this Solution


Free BrainMass Quizzes
Business Processes

This quiz is intended to help business students better understand business processes, including those related to manufacturing and marketing. The questions focus on terms used to describe business processes and marketing activities.

Marketing Research and Forecasting

The following quiz will assess your ability to identify steps in the marketing research process. Understanding this information will provide fundamental knowledge related to marketing research.

Writing Business Plans

This quiz will test your understanding of how to write good business plans, the usual components of a good plan, purposes, terms, and writing style tips.

MS Word 2010-Tricky Features

These questions are based on features of the previous word versions that were easy to figure out, but now seem more hidden to me.

Employee Orientation

Test your knowledge of employee orientation with this fun and informative quiz. This quiz is meant for beginner and advanced students as well as professionals already working in the HR field.