Titlebook: Redundancy in Mathematical Programming; A State-of-the-Art S Mark H. Karwan,Vahid Lotfi,Jan Telgen Conference proceedings 1983 Springer-Ver

搜尋

A Reduction Procedure for Linear and Integer Programming Models,A procedure is described for simplifying linear and integer programming models. The procedure performs tests which may:

granite

The Noncandidate Constraint Method,Thompson, Tonge, and Zionts (1966) defined a . in a linear programming problem as one which could be dropped without changing the feasible region. Most linear programs have some redundant constraints, and it would be desirable to be able to identify them. However, the discovery of redundant constraints is computationally extremely costly.

Introduction

Programming the Methods and Experimental Design,Using the size-reduction techniques presented in Chapters 3 through 11 as a base together with the insights presented in Chapter 12, we programmed and tested all the methods on the CDC Cyber-174 computer system at the State University of New York at Buffalo.

AGOG

Results of the Sign Test Methods,In this chapter we present the results of the sign test methods on randomly generated problems as well as on structured problems. The results of the remaining methods will be presented in the next chapter.

GLEAN

Improvements and Extensions,In Chapters 14 and 15 we presented results of size-reduction techniques on sets of randomly generated and structured problems. In presenting the results, we suggested some changes which have promise for improving the performance of these techniques.

遣返回國

清晰

過度

Redundancy in Mathematical Programming978-3-642-45535-3Series ISSN 0075-8442 Series E-ISSN 2196-9957

conifer

試驗