Purchase Solution

Maximization or minimization of a quantity

Not what you're looking for?

Ask Custom Question

(See attached file for full problem description)

In the graph area problems looking for the steps

---
1. The maximization or minimization of a quantity is the

a. goal of management science.
b. decision for decision analysis.
c. constraint of operations research.
d. objective of linear programming.

2. Which of the following is a valid objective function for a linear programming problem?
a. Max 5xy
b. Min 4x + 3y + (2/3)z
c. Max 5x2 + 6y2
d. Min (x1 + x2)/x3

3. A solution which satisfies all the constraints of a linear programming problem except the nonnegativity constraints is called
a. optimal.
b. feasible.
c. infeasible.
d. semi-feasible.

4. 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 at the highest location.
c. find the feasible point that is closest to the origin.
d. none is these is true.

5. The improvement in the value of the objective function per unit increase in a right-hand side is the
a. sensitivity value.
b. dual price.
c. constraint coefficient.
d. slack value.

6. Solve the following system of simultaneous equations.

6X + 2Y = 50
2X + 4Y = 20

a- X = 8, Y = 10
b- X = 8, Y = 11
c- X = 18, Y = 1
d- X = 8, Y = 1

7-10. Use this graph to answer the questions.

Max 20X + 10Y
s.t. 12X + 15Y =< 180
15X + 10Y =< 150
3X - 8Y =< 0
X , Y >= 0

7- Which area (I, II, III, IV, or V) forms the feasible region?

a. Point D
b. Area III
c. Constraints 2 and 3
d. S2 and S3 are equal to 0

8- Which point (A, B, C, D, or E) is optimal?

a. Point D
b. Area III
c. Constraints 2 and 3
d. S2 and S3 are equal to 0

9- Which constraints are binding?

a. Point D
b. Area III
c. Constraints 2 and 3
d. S2 and S3 are equal to 0

10- Which slack variables are zero?

a. Point D
b. Area III
c. Constraints 2 and 3
d. S2 and S3 are equal to 0
---

Attachments
Purchase this Solution
Solution Summary

Solution contains explanation and answers of multiple choice questions.

Purchase this Solution
Free BrainMass Quizzes
Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Probability Quiz

Some questions on probability

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

View More Free Quizzes
Related BrainMass Solutions

  • Profit Maximization, Cost Minimization

    Cost minimization means producing a given output quantity at minimal cost. For Profit maximization output is no longer given. We assume that a company chooses inputs and output in order to maximize profits.

  • Hungarian method and EOQ.

    . --> Hungarian method is applicable for minimization problem. Assignment problem having maximization as objective function can be easily converted into a minimization problem and then solved using Hungarian method.

  • Product maximization v. Cost minimization

    584928 Product maximization v. Cost minimization Cost minimization for a given level of production is equivalent or identical the concept of product maximization for a given cost level. True of False. Explain.

  • Slack, Surplus, and Artificial Variables

    Similarities and differences between minimization and maximization problems in LP using graphical solution Similarities Some of the similarities between minimization and maximization problems are that both have objective functions that have decision

  • Quantitative Methods - Integer programming

    a. Sometimes b. Never c. Always à Explanation: In maximization problem the left hand side of constraints must be less than or equal to right hand side values.

  • Linear Programming Problems Requirements and Steps

    A minimization or maximization problem can be classified as linear programming if it has the following properties: 1. The objective of the decision-maker must either be to maximize or to minimize. 2.

  • Linear Programming : Optimal Solutions for Ace Lumber

    The response received a rating of "5/5" from the student who originally posted the question.

  • Determining profit maximizing output level

    For profit maximization or loss minimization MR=MC=P In the given case MR=MC=P=$3.50 So, we can say that firm is maximizing its profits or minimizing its losses at this output level.

  • quantity labor

    This is a cost-minimization question: The firm will produce at the output level Q = 10,000 by varying K and L.

  • output, marginal cost, average cost, price, and profit at the average-cost minimizing activity level

    A. Determine the supply curve for each firm. Express price as a function of quantity and quantity as a function of price. (Hint: Set P = MR = MC to find each firm's supply curve.) B.

View More Related Solutions