Consider the Following Discrete Nonlinear Programming Problem

question 4

Essay

Consider the following discrete nonlinear programming problem.Maximize Z = ,subject to x₁ + x₂ ≤ 0.75 and each variable is restricted to the values: .
(a)Reformulate this problem as a pure binary integer linear programming problem.
(b)Use the following outline in designing the main features of a branch-and-bound algorithm for solving this problem (and similar problems)directly without reformulation.(1)Specify the tightest possible nonlinear programming relaxation that has only continuous variables,and so can be solved efficiently by nonlinear programming techniques.(2)Specify the fathoming tests.(3)Specify a branching procedure that involves specifying two ranges of values for a single variable.

---

Definitions:

Business Firms

Organizations engaged in commercial, industrial, or professional activities, aiming to generate profits.

Production Possibilities Frontier

A graphical representation showing the maximum amount of two goods or services that can be produced within a given set of resources.

Recession

A brief spell of economic backslide, with a noted reduction in commerce and industrial production, usually spotted by a fallen GDP in two consecutive quarters.

Employment

A relationship between two parties, usually based on a contract where work is paid for, where one party, which may be a corporation, for profit, not-for-profit organization, co-operative or other entity is the employer and the other is the employee.