Combinatorial Optimization: Packing and Covering (CBMS-NSF by Gérard Cornuéjols

By Gérard Cornuéjols

This monograph offers new and chic proofs of classical effects and makes tough effects available. The integer programming versions referred to as set packing and set overlaying have a large diversity of purposes. occasionally, because of the specified constitution of the constraint matrix, the ordinary linear programming leisure yields an optimum answer that's quintessential, hence fixing the challenge. occasionally, either the linear programming leisure and its twin have critical optimum options. lower than which stipulations do such integrality stipulations carry? this query is of either theoretical and functional curiosity. Min-max theorems, polyhedral combinatorics, and graph concept all come jointly during this wealthy quarter of discrete arithmetic. This monograph offers numerous of those attractive effects because it introduces mathematicians to this energetic sector of study.

To inspire learn at the many interesting open difficulties that stay, Dr. Cornuéjols is supplying a $5000 prize to the 1st paper fixing or refuting all the 18 conjectures defined within the publication. to say one of many prizes pointed out within the preface, papers needs to be authorised through a high quality refereed magazine (such as magazine of Combinatorial concept B, Combinatorica, SIAM magazine on Discrete arithmetic, or others to be decided through Dr. Cornuéjols) earlier than 2020. Claims has to be despatched to Dr. Cornuéjols at Carnegie Mellon collage in the course of his lifetime.

Show description

Read or Download Combinatorial Optimization: Packing and Covering (CBMS-NSF Regional Conference Series in Applied Mathematics) PDF

Similar linear programming books

Linear Programming and its Applications

Within the pages of this article readers will locate not anything under a unified remedy of linear programming. with no sacrificing mathematical rigor, the most emphasis of the e-book is on types and functions. crucial sessions of difficulties are surveyed and awarded through mathematical formulations, by means of answer tools and a dialogue of numerous "what-if" eventualities.

Methods of Mathematical Economics: Linear and Nonlinear Programming, Fixed-Point Theorems (Classics in Applied Mathematics, 37)

This article makes an attempt to survey the center matters in optimization and mathematical economics: linear and nonlinear programming, keeping apart aircraft theorems, fixed-point theorems, and a few in their applications.

This textual content covers purely matters good: linear programming and fixed-point theorems. The sections on linear programming are founded round deriving equipment in keeping with the simplex set of rules in addition to a number of the commonplace LP difficulties, corresponding to community flows and transportation challenge. I by no means had time to learn the part at the fixed-point theorems, yet i believe it might probably turn out to be helpful to investigate economists who paintings in microeconomic conception. This part provides 4 diversified proofs of Brouwer fixed-point theorem, an explanation of Kakutani's Fixed-Point Theorem, and concludes with an explanation of Nash's Theorem for n-person video games.

Unfortunately, crucial math instruments in use through economists at the present time, nonlinear programming and comparative statics, are slightly pointed out. this article has precisely one 15-page bankruptcy on nonlinear programming. This bankruptcy derives the Kuhn-Tucker stipulations yet says not anything in regards to the moment order stipulations or comparative statics results.

Most most likely, the unusual choice and insurance of subject matters (linear programming takes greater than 1/2 the textual content) easily displays the truth that the unique variation got here out in 1980 and likewise that the writer is admittedly an utilized mathematician, no longer an economist. this article is worthy a glance if you want to appreciate fixed-point theorems or how the simplex set of rules works and its purposes. glance in other places for nonlinear programming or newer advancements in linear programming.

Planning and Scheduling in Manufacturing and Services

This booklet makes a speciality of making plans and scheduling functions. making plans and scheduling are sorts of decision-making that play an incredible position in so much production and providers industries. The making plans and scheduling services in a firm normally use analytical thoughts and heuristic tips on how to allocate its constrained assets to the actions that experience to be performed.

Optimization with PDE Constraints

This publication offers a contemporary advent of pde limited optimization. It presents an exact practical analytic remedy through optimality stipulations and a cutting-edge, non-smooth algorithmical framework. in addition, new structure-exploiting discrete options and massive scale, virtually suitable functions are provided.

Additional resources for Combinatorial Optimization: Packing and Covering (CBMS-NSF Regional Conference Series in Applied Mathematics)

Sample text

The international manufacturing manager usually faces an ex post evaluation of his/her international sourcing decisions over a rather short term period (in the range of a few months to less than two years) and with the use of cost data that reflects the actually realized (as compared to the planned or expected over the long run) macroeconomic data. , development of a supplier network that is relatively insensitive to the potential realizations of the macroeconomic parameters over the planning horizon, as a more appropriate approach for supplier selection in the volatile international environment.

The problem can be easily motivated within the context of planning multi-item orders in a limited storage space warehouse or retail facility. The facility orders n different items to meet forecasted demand over a planning horizon, with the main cost considerations involving economies of scale from ordering large quantities (as reflected in ordering costs per placed order) and inventory holding costs. Let us assume that the items are ordered in standardized containers that require a unit of storage space, and Di is the demand for item i in terms of the number of such containers.

M. , 501-511. 1 THE ROBUST DISCRETE OPTIMIZATION PROBLEM The main objective of this chapter is to discuss the formulation of an optimization problem the solution of which leads to the identification of robust decisions. In Chapter 1 we formally defined the Robustness Approach to Decision Making. According to our discussion, three different robustness criteria can be used for the selection of the robust decision. esF. esF. min max(J(X,D S) ses Relative Robustness: The relative robust decision XR is such that 26 P.

Download PDF sample

Rated 4.85 of 5 – based on 46 votes