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:

Functional Currency

The primary currency used by a business entity in its financial statements, reflecting the economic environment in which it primarily operates.

Net Income

The total profit of a company after all expenses, taxes, and costs have been subtracted from total revenue.

Financial Statements

Formal records that outline the financial activities and conditions of a business, individual, or other entity.

Plant and Equipment

Tangible long-term assets owned by a firm, used in the production or supply of goods and services, such as machinery and buildings.