We present some conditions, weaker than convexity, guaranteeing that the set of global maximum points of a function over a polyhedron P is a union or faces of P. These results are then applied to prove polynomial-time solvability for some problems.

On a class of functions attaining their maximum at the vertices of a polyhedron

1989

Abstract

We present some conditions, weaker than convexity, guaranteeing that the set of global maximum points of a function over a polyhedron P is a union or faces of P. These results are then applied to prove polynomial-time solvability for some problems.
1989
Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo" - ISTI
Inglese
22
191
195
https://www.sciencedirect.com/science/article/pii/0166218X88900935
Sì, ma tipo non specificato
Combionatorial optimization
Convex maximization
Polynomial-time solvability
Maximum principle
codice puma /cnr.iei/1989-A0-012 (codice orig. IEI-A0-12)
1
info:eu-repo/semantics/article
262
Tardella, F
01 Contributo su Rivista::01.01 Articolo in rivista
restricted
File in questo prodotto:
File Dimensione Formato  
prod_418303-doc_147698.pdf

solo utenti autorizzati

Descrizione: On a class of functions attaining their maximum at the vertices of a polyhedron
Tipologia: Versione Editoriale (PDF)
Dimensione 422.34 kB
Formato Adobe PDF
422.34 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/368881
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 20
  • ???jsp.display-item.citation.isi??? ND
social impact