a)Consider the following nonlinear programming problem.
max−4x^2 + |3x − 9| + 3 − x
s.t. x belongs to [−5, 5]
Which of the following is the solution to the nonlinear programming
problem? (Explanation Please)
A. x = −5.
B. x = 5.
C. x = −1/2.
D. x = 3.
b)Consider the following nonlinear programming problem.
max x^2 + |2x − 4| + 2 − 3x
s.t. x belongs to [−5, 5]
Which of the following is the set of critical points of the
nonlinear programming problem? (Explanation)
A. x = −5, x = 1/2,x=2,x=5
2 , x = 2, x = 5,x=5/2,x=5
B. x = −5, x = 2, x = 5
2 , x = 5.
C. x = −5, x = 1
2 , x = 2, x = 5
2 , x = 5.
D. x = −5, x = 2, x = 5.
c)3. Consider the following quadratic nonlinear program.
(Explanation)
max f(x) = -5x^2-3y^2+2xy+4x+6y
s.t. 2x+3y >= 12
i) Determine whether the function f(x) is convex, concave, or
neither.

As per HomeworkLib policy we only have authority to post answers to the first question only.
Please up vote the solution if you like the answer to the question
a)Consider the following nonlinear programming problem. max−4x^2 + |3x − 9| + 3 − x s.t....
Find the complete optimal solution to this linear programming problem (using Excel) and enter the optimal x value. Max 5X + 6Y s.t. 3X + Y <= 15 X + 2Y <= 12 3X + 2Y <= 24 X , Y >= 0 Find the complete optimal solution to this linear programming problem using Excel and type in the optimal value of X below (X*=?). Max 2X + 3Y s.t. 4X + 9Y <= 72 10X + 11Y <= 110...
Find the complete optimal solution to this linear programming problem. Max 5x + 3y s.t. 2x + 3y £ 30 2x + 5y £ 40 6x - 5y £ 0 x , y ³ 0
please answer the question by computer
Problem 2. (25 points) Consider the following integer nonlinear programming problem. max 2 = x1x2x s.t. X1 + 2x2 + 3x3 < 10, X1 >1, x2 > 1, X3 >1, X1, X2, X3 are integers. Use dynamic programming to solve this problem.
Question 20 (4 points) 2X, +X, E3 3x,+ ider the following linear programming model: Max: 4x,+2X2 +X, Subject to: 2E1 X X0 What is causing this problem to violate one of the properties or asumptions for curvilinear proportionality indivisiblilty linearity
PROBLEMS Solve for y. 3.1. - x + 4x + sin 6x 3.4. y + 3x = 0 3.5. (x-1)? ydx + x? (y - 1)dy = 0 Just find a solution. Solving for y is tough. Test for exactness and solve if exact. 3.6. (y - x) dx + (x? - y) dy - 0 3.7. (2x + 3y) dx + (3x + y - 1) dy - 0 3.8. (2xy Y + 2xy + y) dx + (x*y*el...
Consider the following integer program Max 2x+3y s.t 6x+7y23 x-y<12 xy0 x,y: integer Let V1 denote the optimal objective value of the above optimization problem. Let V2 denote the optimal objective value of the optimization problem obtained by dropping "x,y: integer" constraint. Similarly, let V3 denote the optimal objective value of the optimization problem obtained by dropping "x-y<-12" constraint which one of the following statements is correct? a. V2 V1 and V3<-V1 b. V1 V2 and V1<-V3 c. V2V1 but...
For the following linear programming problem a. change to standard for; b. use graphical approach to find complete optimal solutions(X, Y and optimal objective function value) Max 5X+6Y s.t. 3X+Y <= 15 X+2Y <= 12 3X+2Y <= 24 X, Y >= 0
Consider the following nonlinear program: min s.t. - (a) Express the objective function of the above problem in the standard quadratic function form: (b) Find the gradient and the Hessian of f(x). (c) If possible, solve the minimisation problem and give reasons why the solution you found is a global minimum rather than just a local minimum. Otherwise, demonstrate that the problem is unbounded. f (x: y) = (x + 2y)2-2x-y We were unable to transcribe this imageWe were unable...
2- The following linear programming problem maximizes the profit in a manufacturing setup. Suppose that the first and second constraints show the labor and material constraint, respectively max z = 4x + 3x, +5x, S.T. x + 2x + 3x, 39 +3x, + x, 312 *.*, 20 Optimal table: NS RHS 6/5 X3 1/5 2/5 -1/5 3/5 X1 -1/5 27/5 O 18/5 6/5 - 1) Fill the blank cells in the table using Simplex Matrix Math. 2) Find the range...
Consider the following linear programming problem. Maximize p = 5x + 7y subject to the constraints 3x + 8y ≤ 1 4x - 5y ≤ 4 2x + 7y ≤ 6 x ≥ 0, y ≥ 0 Write the initial simplex tableau.