Surrogate Dual Multiplier Search Procedures in Integer Programming

Article Abstract:

Search procedures for optimal Lagrange multipliers provide good bounds in branch and bound models. This led to successful application of Lagrangean duality in integer programming. Several surrogate multiplier procedures are developed. Superior bounds can be produced. Tables of results are included. A graph shows the comparative convergence of the linear programming method with and without early subproblem termination.

Integer programming, Algorithm Analysis, Searching, Branch and Bound, Multipliers

---

On Reconciling Conflicting Goals: Applications of Multiobjective Programming

Article Abstract:

The identification of cost-effective solutions to problems with multiple objectives is studied. The problem of achieving environmental objectives is used as an example. One approach was to use the objectives as targets to minimize cost over a feasible region. The alternative was to maximize the objective subject to a set of feasible constraints such as expenditure limitation. The results are compared.

Environmental protection, Performance/Cost Relationship, Feasibility, Theory, Minimization, Conflict of Interest

---

Similar abstracts:

• Abstracts: A Class of Linear Programs Convertible to Network Problems. Proper Efficiency and the Linear Fractional Vector Maximum Problem
• Abstracts: Regenerative Simulation for Estimating Extreme Values. Estimating a Survival Curve When New Is Better Than Used

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.