Solve the following optimisation problem max-r* +2r+1 s.t..r 0

Question

Question

Solve the following optimisation problem

$max-r* +2r+1$

$s.t..r 0$

Answer 1

Answer #1

In order to solve the optimization problem, find the first derivative of the equation and put it equal to 0

F'(x) = -2x+2 = 0

This gives x = 1

Also, calculate the second derivative

F''(x) = -2

Since the second derivative is less than 0, the value of x = 1 is the absolute maximum.

Answer 2

Similar Homework Help Questions

Use the two-phase simplex method to solve the problem max z = 3х + х) s.t....

Use the two-phase simplex method to solve the problem max z = 3х + х) s.t. ху + х = 3 2х + x2 3 4 x + x2 = 3 х1, х2 = 0
The consumer's problem is max u(C1, C2) s.t. C1 +5 < y1 C2 < y2 +...

The consumer's problem is max u(C1, C2) s.t. C1 +5 < y1 C2 < y2 + (1+r)s C1 > 0, c220 Characterize the solution
Problem needs to be done Excel. 1. Solve the following LP problem. Max Z = 3X1...

Problem needs to be done Excel. 1. Solve the following LP problem. Max Z = 3X1 + 5X2 S.T. 4X1 + 3X2 >= 24 2X1 + 3X2 <= 18 X1, X2 >= 0 a) Solve the Problem b) Identify the reduced costs and interpret each. c) Calculate the range of optimality for each objective coefficient. d) Identify the slacks for the resources and calculate the shadow price for each resource.

Consider the following LP: Max x1 +x2 +x3 s.t. x1 +2x2 +2x3 ≤ 20 Solve this...

Consider the following LP: Max x1 +x2 +x3 s.t. x1 +2x2 +2x3 ≤ 20 Solve this problem without using the simplex algorithm, but using the fact that an optimal solution to LP exists at one of the basic feasible solutions.
samplex Problem1: Solve the following problem using simplex method: Max. z = 2 x1 + x2...

samplex Problem1: Solve the following problem using simplex method: Max. z = 2 x1 + x2 – 3x3 + 5x4 S.t. X; + 7x2 + 3x3 + 7x, 46 (1) 3x1 - x2 + x3 + 2x, 38 .(2) 2xy + 3x2 - x3 + x4 S 10 (3) E. Non-neg. x > 0, x2 > 0, X3 > 0,44 20 Problem2: Solve the following problem using big M method: Max. Z = 2x1 + x2 + 3x3 s.t. *+...
(1) Convert the following LPs to standard form: 22 (a) max z 3x1 + 2x2 s.t....

(1) Convert the following LPs to standard form: 22 (a) max z 3x1 + 2x2 s.t. 21 < 40 X1 + x2 < 80 2x1 + x2 < 100 X1, X2 > 0 (b) max z = 2x1 s.t. X1 – X2 <1 2x1 + x2 > 6 X1, X2 > 0 (c) max z = 3x1 + x2 s.t. 1 > 3 X1 + x2 < 4 2x1 – X2 = 3 X1, X2 > 0

For the linear program Max 3A+2B s.t. A+B>=4 3A+4B<=24 A>=2 A-B<=0 A, B>=0 a. Write the...

For the linear program Max 3A+2B s.t. A+B>=4 3A+4B<=24 A>=2 A-B<=0 A, B>=0 a. Write the problem in standard form. b. Solve the problem. c. What are the values of the slack and surplus variables at the optimal solution?
2. Consumption-Savings Decision: The Household's decision problem is: 1- 1- max - C1,C2,8 1-7."1-7 s.t. Ci+s=(<)yi...

2. Consumption-Savings Decision: The Household's decision problem is: 1- 1- max - C1,C2,8 1-7."1-7 s.t. Ci+s=(<)yi C2 = (*)(1+r)s + y2 where ci and c2 are consumption in periods 1 and 2 respectively; yi and Y2 are income in periods 1 and 2 respectively; s is savings; r is the interest rate on savings.y is a parameter controlling the concavity of the utility function, and will determine intertemporal substitution of consumption.4 We assume that y> 1; so utility is increasing...
Solve the following linear fractional program: max ? = ?1+2?2+?3+6/ 3?1+?3+5 s.t. ?1 + ?2 +...

Solve the following linear fractional program: max ? = ?1+2?2+?3+6/ 3?1+?3+5 s.t. ?1 + ?2 + 3?3 ≤ 10 2?1 + 3?2 ≤ 7 ?1,?2,?3 ≥ 0 Let ? = 1/ 3?1+?3+5 and ?1 = ??1,?2 = ??2, ?3 = ??3.

Let (IP) be the following integer program: max (0, -1). s.t. 1-1 -107 -10 10 -11</-0.5...

Let (IP) be the following integer program: max (0, -1). s.t. 1-1 -107 -10 10 -11</-0.5 1-10 / 0 z integer Let (LP) be the LP relaxation of (IP). We draw the feasible region of (LP) here. 2. . . . . . . to (LP), and prove that it is optimal by providing a (a) Determine an optimal solution certificate of optimality.