5. Define a linear programming objective and constraints that is applicable to Facebook. Provide the necessary calculations (graphically and algebraically)
Let’ say we will be increasing Facebook advertising budget, so, Objective function is Maximizing the Facebook advertising budget Z = 110*X1 + 180*X2
Here, X1 = Number of Entertainment Ad, X2 = Number of Educational Ad
Budget for each Entertainment Ad = 110 and Budget for each Educational Ad = 180,
Constraints are
120*X1+200*X2≤ 2500
125*X1+190*X2≤ 3000
Each Entertainment Ad can be sold at 120 and 125 and each Educational Ad can be sold at 200 and 190 for the above mentioned limit ,
adding the slack variable X3,
adding the slack variable X4, cause the constraints are having
'≤'
first tableau
leaving variable is P3
entering variable is P2
Intermediate operations
Pivot row (Row 1):
2500 / 200 = 25 / 2
120 / 200 = 3 / 5
200 / 200 = 1
1 / 200 = 1 / 200
0 / 200 = 0
Row 2:
3000 - (190 * 25 / 2) = 625
125 - (190 * 3 / 5) = 11
190 - (190 * 1) = 0
0 - (190 * 1 / 200) = -19 / 20
1 - (190 * 0) = 1
Row Z:
0 - (-180 * 25 / 2) = 2250
-110 - (-180 * 3 / 5) = -2
-180 - (-180 * 1) = 0
0 - (-180 * 1 / 200) = 9 / 10
0 - (-180 * 0) = 0
leaving variable is P2
entering variable is P1
Intermediate operations
Pivot row (Row 1):
25 / 2 / 3 / 5 = 125 / 6
3 / 5 / 3 / 5 = 1
1 / 3 / 5 = 5 / 3
1 / 200 / 3 / 5 = 1 / 120
0 / 3 / 5 = 0
Row 2:
625 - (11 * 125 / 6) = 2375 / 6
11 - (11 * 1) = 0
0 - (11 * 5 / 3) = -55 / 3
-19 / 20 - (11 * 1 / 120) = -25 / 24
1 - (11 * 0) = 1
Row Z:
2250 - (-2 * 125 / 6) = 6875 / 3
-2 - (-2 * 1) = 0
0 - (-2 * 5 / 3) = 10 / 3
9 / 10 - (-2 * 1 / 120) = 11 / 12
0 - (-2 * 0) = 0
optimal solution value Z = 6875 / 3
X1 = 125 / 6
X2 = 0
Using Graphical Method:
5. Define a linear programming objective and constraints that is applicable to Facebook. Provide the necessary...
Multi-objective linear programming (MOLP) provide: a. a way to incorporate soft constraints b. a way to incorporate hard constraints c. a simple way to solve the problem as a relaxed LP d. a way to analyze LP problems with multiple conflicting objectives
3. Consider the linear programming problem with objective function Q = 4x – 3y and constraints: 9x + 4y > 180, 3x + 8y > 120, 0 < x < 35, y > 0. Graph all constraints and show the feasible region and all corner points. Can the objective function be maximized? If so, find the maximum value of Q.
Define: a. Model, Variables, Parameters b. Constraints in linear programming c. Mathematical relationships known with certainty and probabilistic conditions(risk model)
Provide examples (using simple formulations with couple of constraints) of linear programming formulations for 1. Infeasible solution 2. Unbound solution
Which of the following is not a characteristic of a goal programming method? a) The constraints should be linear b) Goals should be prioritized c) The objective function should be linear d) There should be a single objective function
State the linear programming problem in mathematical terms, identifying the objective function and the constraints A firm makes products A and B. Product A takes 3 hours each on machine L and machine M; product B takes 4 hours on L and 3 hours on M. Machine L can be used for 12 hours and M for 10 hours. Profit on product A is $7 and $9 on B. Maximize profit. Maximize 7A 9B Subject to: 3A +4B s 12...
QUESTION 15 3 p The objective of a linear programming problem is to maximize 1.50X + 1.50Y, subject to 3X + 2Y = 600, 2X +4YS 600, and X,Y 2 0. What is the optimal (best) value of the objective function, subject to the constraints and rounded to the nearest whole number? 225 300 338 425 500
MATLAB Problem Create a code to plot 2-D linear programming problems. label all constraints and hatch the infeasible region for constraints and bounds. Use arrow to show objective function gradient and linprog function. The user should input a cost function vector, two vectors xmax and xmin for bounds, and various constraints like: equality and inequality.
Solve the following linear programming problem graphically: Maximize Z=4X₁+4X₂, Subject to: 3X₁ + 5X₂ ≤ 150 X₁ - 2X₂ ≤ 10 5X₁ + 3X₂ ≤ 150 X₁, X₂ ≥ 0 1) Using the line drawing tool, plot the constraints by picking two endpoints for each line. Do not plot the nonnegativity constraints. 2) Using the point drawing tool, plot the five corner points which define the feasible region. The optimal solution is X₁ = _______ and X₂ = _______ (round your responses to two decimal places). Maximum profit is $_______
Find the indicated maximum or minimum value of the objective function in the linear programming problem. Maximize f - 30x + 40y subject to the following constraints. x + 2y = 48 x + y s 30 2x + y 50 x 20, y 20 Need Help? Read It Vatch It Talk to a Tutor -/12.5 POINTS HARMATHAP9 4.2.015.MI. EE Solve the following linear programming problem. Restrict x 20 and y 20. Maximize = 3x + 5y sub/ect to the...