Non-linear programming problems


Classify the following problems as to whether they are pure-integer, mixed-integer, zero-one, goal, or nonlinear programming problems.

Maximize Z = 5 X1 + 6 X1 X2 + 2 X2
Subject to: 3 X1 + 2 X2 = 6
X1 + X2 = 8
X1, X2 = 0

Minimize Z = 8 X1 + 6 X2
Subject to: 4 X1 + 5 X2 = 10
X1 + X2 = 3
X1, X2 = 0
X1, X2 = 0 or 1

Maximize Z = 10 X1 + 5 X2
Subject to: 8 X1 + 10 X2 = 10
4 X1 + 6 X2 = 5
X1, X2 integer

Minimize Z = 8 X12 + 4 X1 X2 + 12 X22
Subject to: 6 X1 + X2 = 50
X1 + X2 = 40

Your response should be at least 200 words in length. You are required to use at least your textbook as source material for your response. All sources used, including the textbook, must be referenced; paraphrased and quoted material must have accompanying citations. Please use the following as a references…

Render, B., Stair, R. M., Jr., & Hanna, M. E. (2012). Quantitative analysis for management (11th ed.). Upper Saddle River, NJ: Prentice Hall.

Request for Solution File

Ask an Expert for Answer!!
Basic Statistics: Non-linear programming problems
Reference No:- TGS01613621

Expected delivery within 24 Hours