Question

In: Finance

I am sure that any company wants to maximize its profit and linear programming might be...

I am sure that any company wants to maximize its profit and linear programming might be used to find an answer concerning the value of this profit. If you would want to build the linear programming problem that provides such answers, how many constraints would you add? Do you think that an increase in the number of constraints implies solving a more realistic problem

Solutions

Expert Solution

In every company resources are constraint ( Say raw material, employee hours, production capacity, etc. ). Just imagine a situation where you build linear programming with only constraints as employee hours and production capacity in such case profit maximization done by it is flawed.

Eg: Production capacity is 100 units but raw material available to do it is 50 units only. In this case since raw material is not taken as constraints you would assume that all 100 units be produced produced. But reality is that you can produce only 50 units as you have restrictions on raw material. Thus profit maximization is incorrect.

Thus only when all constraints are involved. Linear programming would give realistic solution to profit maximization. If not it is always flawed.

Note: This doesn't mean you add constraints which do not exist. So it is not about how many constraints you need to have, it is about whether you have included all relevant constraints pertaining to problem. It may be as less as 2 or as many as 100.


Related Solutions

Consider the following linear programming problem:                   Maximize Profit    30X + 50Y          &
Consider the following linear programming problem:                   Maximize Profit    30X + 50Y                   Subject to              4X +   5Y = 40,000                                                                X ≥   3,000                                                                Y ≥   4,000                                                     X ≥ 0 and Y ≥ 0 Use a graph to show each constraint and to identify feasible region. Identify the optimal solution point on your graph. What are the values of X and Y at the optimal solution? From your graph, what is the optimal value of...
Consider the following linear programming problem:                   Maximize Profit    30X + 50Y          &
Consider the following linear programming problem:                   Maximize Profit    30X + 50Y                   Subject to              4X +   5Y = 40,000                                                                X ≥   3,000                                                                Y ≥   4,000                                                     X ≥ 0 and Y ≥ 0 Use a graph to show each constraint and to identify feasible region. Identify the optimal solution point on your graph. What are the values of X and Y at the optimal solution? From your graph, what is the optimal value of...
If I am looking to maximize my investment as an investor and the company I am...
If I am looking to maximize my investment as an investor and the company I am looking at has a low or unstable payout schedule, what would be the point of investing?
I am working on this problem for the company AT & T and am not sure...
I am working on this problem for the company AT & T and am not sure how to start it. Draw a chart of the main inter-organizational linkage mechanisms (e.g., long -term contacts, strategic alliances, mergers) that your organization uses to manage its symbiotic resource interdependencies. Using resource dependence theory and transaction cost theory, discuss why the organization to manage its interdependencies in this way. Do you think the organization has selected the most appropriate linkage mechanisms? Why or why...
For the following linear programming problem:    Maximize z = 2x1+ x2    Such that     ...
For the following linear programming problem:    Maximize z = 2x1+ x2    Such that      x1+ 2x2 ≤ 12          x2 ≥ 3       x1,x2 ≥ 0 (a) Write the first two constraints in equation form by adding slack or subtracting excess (surplus) variables. (b)Find all basic solutions for this LP (c) Which of these solutions are feasible? (d)Which of these feasible solutions is optimal? Find the optimal value of z
A firm wants to maximize its profit. What info about the production of a firm is...
A firm wants to maximize its profit. What info about the production of a firm is needed when trying to determine the optimal amount of labor (N*)it should employ? Explain how that info can help a firm determine their optimal amount of labor.
The objective of a linear programming problem is to maximize 1.50A + 1.50B, subject to 3A...
The objective of a linear programming problem is to maximize 1.50A + 1.50B, subject to 3A + 2B ≤ 600, 2A + 4B ≤ 600, 1A + 3B ≤ 420, and A,B ≥ 0. Using Lingo software determine the optimal product mix for this problem? (include Lingo output) Please use excel! Thanks!
I am stuck on this problem and I am not sure what the solution is. In...
I am stuck on this problem and I am not sure what the solution is. In C Write item.h and item.c. In item.h, typedef a struct (of type t_item) which contains the following information: t_item: char name[MAX_ITEM_NAME_STRING]; char description[MAX_ITEM_DESCRIPTION_STRING]; Make sure that MAX_ITEM_NAME_STRING and MAX_ITEM_DESCRIPTION_STRING are defined with suitable sizes in your item.h. Typical values are, 25 and 80, respectively. Add the following interface definition to item.h: int item_load_items(t_item items[], int max_items, char *filename); Returns the number of objects loaded...
Solve the linear programming problem by the method of corners. Maximize P = 5x + 6y    ...
Solve the linear programming problem by the method of corners. Maximize P = 5x + 6y     subject to   x + y ≤ 10 3x + y ≥ 12 −2x + 3y ≥ 8 x ≥ 0, y ≥ 0  
Solve the linear programming problem by the method of corners. Maximize P = 3x + 6y    ...
Solve the linear programming problem by the method of corners. Maximize P = 3x + 6y     subject to   x + y ≤ 10 3x + y ≥ 12 −2x + 3y ≥ 13 x ≥ 0, y ≥ 0   The maximum is P = ? at (x, y) = ( ? ),
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT