ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (2)
  • Duality  (2)
  • Springer  (2)
  • American Chemical Society
  • American Chemical Society (ACS)
  • American Geophysical Union
  • Institute of Electrical and Electronics Engineers (IEEE)
  • National Academy of Sciences
  • 2015-2019
  • 2005-2009
  • 1990-1994
  • 1980-1984  (2)
  • 2018
  • 2017
  • 2009
  • 1981  (2)
  • Computer Science  (2)
Collection
  • Articles  (2)
Source
Keywords
Publisher
  • Springer  (2)
  • American Chemical Society
  • American Chemical Society (ACS)
  • American Geophysical Union
  • Institute of Electrical and Electronics Engineers (IEEE)
    • +
Years
  • 2015-2019
  • 2005-2009
  • 1990-1994
  • 1980-1984  (2)
Year
Topic
  • 1
    Electronic Resource
    Electronic Resource
    Duality gaps in semi-infinite linear programming—an approximation problem (1981)
    Springer
    Mathematical programming 20 (1981), S. 129-143 
    Details
    ISSN: 1436-4646
    Keywords: Semi-infinite Programs ; Duality ; Linear Perturbations ; Limiting Lagrangean
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper builds upon the relationship between the objective function of a semi-infinite linear program and its constraints to identify a class of semi-infinite linear programs which do not have a duality gap. The key idea is to guarantee the approximation of the primal program by a sequence of linear programs where thenth approximating program is to minimize the objective function subject to the firstn constraints. The paper goes on to show that any program not in the identified class can be linearly perturbed into it with the optimal value of the perturbed program converging to the optimal value of the original program. The results are then extended to the case when an uncountable number of constraints are present by reducing this case to the countable case.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01589340
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Integer programming duality: Price functions and sensitivity analysis (1981)
    Springer
    Mathematical programming 20 (1981), S. 173-195 
    Details
    ISSN: 1436-4646
    Keywords: Integer Programming ; Duality ; Sensitivity Analysis ; Valid Inequalities ; Branch and Bound Methods ; Group Problems ; Lagrangean Relaxation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Recently a duality theory for integer programming has been developed. Here we examine some of the economic implications of this theory, in particular the necessity of using price functions in place of prices, and the possibility of carrying out sensitivity analysis of optimal solutions. In addition we consider the form of price functions that are generated by known algorithms for integer programming.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01589344
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...