Logo Logo

Some Easy Postoptimality Analysis for Zero-One Programming, Management Science

Abstract

Some easy postoptimality analysis for zero-one programming is developed. First, a procedure is presented for obtaining a set K of 0-1 solutions whose objective function values are within a specified tolerance of the optimum. Then sufficiency conditions for K to contain the optimum of a revised problem are derived. Computational experience with a number of test problems indicates that K can be economically obtained and that the sufficiency tests provide a significant postoptimization capability.

Type

Article

Author(s)

Andris Zoltners

Date Published

1976

Citations

Zoltners, Andris. 1976. Some Easy Postoptimality Analysis for Zero-One Programming. Management Science. 22(7): 759-765.

KELLOGG INSIGHT

Explore leading research and ideas

Find articles, podcast episodes, and videos that spark ideas in lifelong learners, and inspire those looking to advance in their careers.
learn more

COURSE CATALOG

Review Courses & Schedules

Access information about specific courses and their schedules by viewing the interactive course scheduler tool.
LEARN MORE

DEGREE PROGRAMS

Discover the path to your goals

Whether you choose our Full-Time, Part-Time or Executive MBA program, you’ll enjoy the same unparalleled education, exceptional faculty and distinctive culture.
learn more