Question: Consider the following nonlinear programming problem: Maximize Z = 5x1 + x2, subject to 2x12 + x2 13 x12 + x2 9 and
Maximize Z = 5x1 + x2,
subject to
2x12 + x2 ≤ 13
x12 + x2 ≤ 9 and
x1 ≥ 0, x2 ≥ 0.
(a) Show that this problem is a convex programming problem.
(b) Use the separable programming technique discussed at the end of Sec. 13.8 to formulate an approximate linear programming model for this problem. Use the integers as the breakpoints of the piecewise linear function.
Step by Step Solution
3.36 Rating (168 Votes )
There are 3 Steps involved in it
a The objective function is linear so concave g 1 and g 2 are convex b Let x 1 x 11 x 12 x ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
545-M-S-L-P (772).docx
120 KBs Word File
