casadi 3.6.3__cp311-none-manylinux2014_i686.whl → 3.6.4__cp311-none-manylinux2014_i686.whl

casadi/include/highs/io/Filereader.h

@@ -2,13 +2,11 @@
 /*                                                                       */
 /*    This file is part of the HiGHS linear optimization suite           */
 /*                                                                       */
-/*    Written and engineered 2008-2022 at the University of Edinburgh    */
+/*    Written and engineered 2008-2023 by Julian Hall, Ivet Galabova,    */
+/*    Leona Gottwald and Michael Feldmeier                               */
 /*                                                                       */
 /*    Available as open-source under the MIT License                     */
 /*                                                                       */
-/*    Authors: Julian Hall, Ivet Galabova, Leona Gottwald and Michael    */
-/*    Feldmeier                                                          */
-/*                                                                       */
 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
 /**@file io/Filereader.h
  * @brief

casadi/include/highs/io/FilereaderEms.h

@@ -2,13 +2,11 @@
 /*                                                                       */
 /*    This file is part of the HiGHS linear optimization suite           */
 /*                                                                       */
-/*    Written and engineered 2008-2022 at the University of Edinburgh    */
+/*    Written and engineered 2008-2023 by Julian Hall, Ivet Galabova,    */
+/*    Leona Gottwald and Michael Feldmeier                               */
 /*                                                                       */
 /*    Available as open-source under the MIT License                     */
 /*                                                                       */
-/*    Authors: Julian Hall, Ivet Galabova, Leona Gottwald and Michael    */
-/*    Feldmeier                                                          */
-/*                                                                       */
 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
 /**@file io/FilereaderEms.h
  * @brief

casadi/include/highs/io/FilereaderLp.h

@@ -2,13 +2,11 @@
 /*                                                                       */
 /*    This file is part of the HiGHS linear optimization suite           */
 /*                                                                       */
-/*    Written and engineered 2008-2022 at the University of Edinburgh    */
+/*    Written and engineered 2008-2023 by Julian Hall, Ivet Galabova,    */
+/*    Leona Gottwald and Michael Feldmeier                               */
 /*                                                                       */
 /*    Available as open-source under the MIT License                     */
 /*                                                                       */
-/*    Authors: Julian Hall, Ivet Galabova, Leona Gottwald and Michael    */
-/*    Feldmeier                                                          */
-/*                                                                       */
 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
 /**@file io/FilereaderLp.cpp
  * @brief

casadi/include/highs/io/FilereaderMps.h

@@ -2,13 +2,11 @@
 /*                                                                       */
 /*    This file is part of the HiGHS linear optimization suite           */
 /*                                                                       */
-/*    Written and engineered 2008-2022 at the University of Edinburgh    */
+/*    Written and engineered 2008-2023 by Julian Hall, Ivet Galabova,    */
+/*    Leona Gottwald and Michael Feldmeier                               */
 /*                                                                       */
 /*    Available as open-source under the MIT License                     */
 /*                                                                       */
-/*    Authors: Julian Hall, Ivet Galabova, Leona Gottwald and Michael    */
-/*    Feldmeier                                                          */
-/*                                                                       */
 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
 /**@file io/FilereaderMps.h
  * @brief

casadi/include/highs/io/HMPSIO.h

@@ -2,13 +2,11 @@
 /*                                                                       */
 /*    This file is part of the HiGHS linear optimization suite           */
 /*                                                                       */
-/*    Written and engineered 2008-2022 at the University of Edinburgh    */
+/*    Written and engineered 2008-2023 by Julian Hall, Ivet Galabova,    */
+/*    Leona Gottwald and Michael Feldmeier                               */
 /*                                                                       */
 /*    Available as open-source under the MIT License                     */
 /*                                                                       */
-/*    Authors: Julian Hall, Ivet Galabova, Leona Gottwald and Michael    */
-/*    Feldmeier                                                          */
-/*                                                                       */
 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
 /**@file io/HMPSIO.h
  * @brief

casadi/include/highs/io/HMpsFF.h

@@ -2,13 +2,11 @@
 /*                                                                       */
 /*    This file is part of the HiGHS linear optimization suite           */
 /*                                                                       */
-/*    Written and engineered 2008-2022 at the University of Edinburgh    */
+/*    Written and engineered 2008-2023 by Julian Hall, Ivet Galabova,    */
+/*    Leona Gottwald and Michael Feldmeier                               */
 /*                                                                       */
 /*    Available as open-source under the MIT License                     */
 /*                                                                       */
-/*    Authors: Julian Hall, Ivet Galabova, Leona Gottwald and Michael    */
-/*    Feldmeier                                                          */
-/*                                                                       */
 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
 /**@file io/HMpsFF.h
  * @brief

casadi/include/highs/io/HighsIO.h

@@ -2,13 +2,11 @@
 /*                                                                       */
 /*    This file is part of the HiGHS linear optimization suite           */
 /*                                                                       */
-/*    Written and engineered 2008-2022 at the University of Edinburgh    */
+/*    Written and engineered 2008-2023 by Julian Hall, Ivet Galabova,    */
+/*    Leona Gottwald and Michael Feldmeier                               */
 /*                                                                       */
 /*    Available as open-source under the MIT License                     */
 /*                                                                       */
-/*    Authors: Julian Hall, Ivet Galabova, Leona Gottwald and Michael    */
-/*    Feldmeier                                                          */
-/*                                                                       */
 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
 /**@file io/HighsIO.h
  * @brief IO methods for HiGHS - currently just print/log messages
@@ -19,17 +17,18 @@
 #include <array>
 #include <iostream>
 
-#include "util/HighsInt.h"
+#include "lp_data/HighsCallback.h"
+//#include "util/HighsInt.h"
 
 class HighsOptions;
 
 const HighsInt kIoBufferSize = 1024;  // 65536;
 
+enum class HighsFileType { kNone = 0, kOther, kMps, kLp, kMd, kHtml };
+
 /**
  * @brief IO methods for HiGHS - currently just print/log messages
  */
-enum class HighsLogType { kInfo = 1, kDetailed, kVerbose, kWarning, kError };
-
 const char* const HighsLogTypeTag[] = {"", "",          "",
                                        "", "WARNING: ", "ERROR:   "};
 enum LogDevLevel {
@@ -42,17 +41,21 @@ enum LogDevLevel {
 };
 
 struct HighsLogOptions {
-  FILE* log_file_stream;
+  FILE* log_stream;
   bool* output_flag;
   bool* log_to_console;
   HighsInt* log_dev_level;
-  void (*log_callback)(HighsLogType, const char*, void*) = nullptr;
-  void* log_callback_data = nullptr;
+  void (*user_log_callback)(HighsLogType, const char*, void*) = nullptr;
+  void* user_log_callback_data = nullptr;
+  void (*user_callback)(const int, const char*, const HighsCallbackDataOut*,
+                        HighsCallbackDataIn*, void*) = nullptr;
+  void* user_callback_data = nullptr;
+  bool user_callback_active = false;
+  void clear();
 };
 
 /**
- * @brief Write the HiGHS version, compilation date, git hash and
- * copyright statement
+ * @brief Write the HiGHS version and copyright statement
  */
 void highsLogHeader(const HighsLogOptions& log_options);
 
@@ -88,6 +91,9 @@ void highsReportLogOptions(const HighsLogOptions& log_options_);
 
 std::string highsFormatToString(const char* format, ...);
 
-const std::string highsBoolToString(const bool b);
+const std::string highsBoolToString(const bool b,
+                                    const HighsInt field_width = 2);
+
+const std::string highsInsertMdEscapes(const std::string from_string);
 
 #endif

casadi/include/highs/io/LoadOptions.h

@@ -2,13 +2,11 @@
 /*                                                                       */
 /*    This file is part of the HiGHS linear optimization suite           */
 /*                                                                       */
-/*    Written and engineered 2008-2022 at the University of Edinburgh    */
+/*    Written and engineered 2008-2023 by Julian Hall, Ivet Galabova,    */
+/*    Leona Gottwald and Michael Feldmeier                               */
 /*                                                                       */
 /*    Available as open-source under the MIT License                     */
 /*                                                                       */
-/*    Authors: Julian Hall, Ivet Galabova, Leona Gottwald and Michael    */
-/*    Feldmeier                                                          */
-/*                                                                       */
 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
 /**@file io/LoadOptions.h
  * @brief
@@ -19,8 +17,11 @@
 
 #include "lp_data/HighsOptions.h"
 
+enum class HighsLoadOptionsStatus { kError = -1, kOk = 0, kEmpty = 1 };
+
 // For extended options to be parsed from filename
-bool loadOptionsFromFile(const HighsLogOptions& report_log_options,
-                         HighsOptions& options, const std::string filename);
+HighsLoadOptionsStatus loadOptionsFromFile(
+    const HighsLogOptions& report_log_options, HighsOptions& options,
+    const std::string filename);
 
 #endif

casadi/include/highs/ipm/IpxWrapper.h

@@ -2,13 +2,11 @@
 /*                                                                       */
 /*    This file is part of the HiGHS linear optimization suite           */
 /*                                                                       */
-/*    Written and engineered 2008-2022 at the University of Edinburgh    */
+/*    Written and engineered 2008-2023 by Julian Hall, Ivet Galabova,    */
+/*    Leona Gottwald and Michael Feldmeier                               */
 /*                                                                       */
 /*    Available as open-source under the MIT License                     */
 /*                                                                       */
-/*    Authors: Julian Hall, Ivet Galabova, Leona Gottwald and Michael    */
-/*    Feldmeier                                                          */
-/*                                                                       */
 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
 /**@file ipm/IpxWrapper.h
  * @brief
@@ -29,7 +27,8 @@ HighsStatus solveLpIpx(HighsLpSolverObject& solver_object);
 HighsStatus solveLpIpx(const HighsOptions& options, HighsTimer& timer,
                        const HighsLp& lp, HighsBasis& highs_basis,
                        HighsSolution& highs_solution,
-                       HighsModelStatus& model_status, HighsInfo& highs_info);
+                       HighsModelStatus& model_status, HighsInfo& highs_info,
+                       HighsCallback& callback);
 
 void fillInIpxData(const HighsLp& lp, ipx::Int& num_col, ipx::Int& num_row,
                    std::vector<double>& obj, std::vector<double>& col_lb,

casadi/include/highs/lp_data/HConst.h

@@ -2,13 +2,11 @@
 /*                                                                       */
 /*    This file is part of the HiGHS linear optimization suite           */
 /*                                                                       */
-/*    Written and engineered 2008-2022 at the University of Edinburgh    */
+/*    Written and engineered 2008-2023 by Julian Hall, Ivet Galabova,    */
+/*    Leona Gottwald and Michael Feldmeier                               */
 /*                                                                       */
 /*    Available as open-source under the MIT License                     */
 /*                                                                       */
-/*    Authors: Julian Hall, Ivet Galabova, Leona Gottwald and Michael    */
-/*    Feldmeier                                                          */
-/*                                                                       */
 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
 /**@file lp_data/HConst.h
  * @brief Constants for HiGHS
@@ -22,6 +20,10 @@
 
 #include "util/HighsInt.h"
 
+const std::string kHighsCopyrightStatement =
+    "Copyright (c) 2023 HiGHS under MIT licence terms";
+
+const size_t kHighsSize_tInf = std::numeric_limits<size_t>::max();
 const HighsInt kHighsIInf = std::numeric_limits<HighsInt>::max();
 const double kHighsInf = std::numeric_limits<double>::infinity();
 const double kHighsTiny = 1e-14;
@@ -30,11 +32,15 @@ const double kHighsZero = 1e-50;
 const std::string kHighsOffString = "off";
 const std::string kHighsChooseString = "choose";
 const std::string kHighsOnString = "on";
+const HighsInt kHighsMaxStringLength = 512;
 const HighsInt kSimplexConcurrencyLimit = 8;
 const double kRunningAverageMultiplier = 0.05;
 
+const bool kAllowDeveloperAssert = false;
 const bool kExtendInvertWhenAddingRows = false;
 
+enum class HighsLogType { kInfo = 1, kDetailed, kVerbose, kWarning, kError };
+
 enum SimplexScaleStrategy {
   kSimplexScaleStrategyMin = 0,
   kSimplexScaleStrategyOff = kSimplexScaleStrategyMin,  // 0
@@ -99,6 +105,16 @@ enum OptionOffChooseOn {
   kHighsOptionOn
 };
 
+enum IpxDualizeStrategy {
+  kIpxDualizeStrategyOff = kHighsOptionOff,
+  kIpxDualizeStrategyChoose = kHighsOptionChoose,
+  kIpxDualizeStrategyOn = kHighsOptionOn,
+  kIpxDualizeStrategyLukas,
+  kIpxDualizeStrategyFilippo,
+  kIpxDualizeStrategyMin = kIpxDualizeStrategyOff,
+  kIpxDualizeStrategyMax = kIpxDualizeStrategyFilippo,
+};
+
 /** SCIP/HiGHS Objective sense */
 enum class ObjSense { kMinimize = 1, kMaximize = -1 };
 
@@ -127,8 +143,9 @@ enum SolutionStyle {
   kSolutionStylePretty,        // 1;
   kSolutionStyleGlpsolRaw,     // 2;
   kSolutionStyleGlpsolPretty,  // 3;
+  kSolutionStyleSparse,        // 4;
   kSolutionStyleMin = kSolutionStyleOldRaw,
-  kSolutionStyleMax = kSolutionStyleGlpsolPretty
+  kSolutionStyleMax = kSolutionStyleSparse
 };
 
 enum GlpsolCostRowLocation {
@@ -140,9 +157,6 @@ enum GlpsolCostRowLocation {
 
 const std::string kHighsFilenameDefault = "";
 
-// Need to allow infinite costs to pass SCIP LPI unit tests
-const bool kHighsAllowInfiniteCosts = true;
-
 enum class HighsPresolveStatus {
   kNotPresolved = -1,
   kNotReduced,
@@ -151,8 +165,16 @@ enum class HighsPresolveStatus {
   kReduced,
   kReducedToEmpty,
   kTimeout,
-  kNullError,
-  kOptionsError,
+  kNullError,     // V2.0: Delete since it's not used!
+  kOptionsError,  // V2.0: Delete since it's not used!
+  kNotSet,
+};
+
+enum class HighsPostsolveStatus {  // V2.0: Delete if not used!
+  kNotPresolved = -1,
+  kNoPrimalSolutionError,
+  kSolutionRecovered,
+  kBasisError
 };
 
 enum class HighsModelStatus {
@@ -160,11 +182,11 @@ enum class HighsModelStatus {
   // values is unchanged, since enums are not preserved in some
   // interfaces
   kNotset = 0,
-  kLoadError,
+  kLoadError,  // V2.0: Delete since it's not used!
   kModelError,
-  kPresolveError,
+  kPresolveError,  // V2.0: Delete since it's not used!
   kSolveError,
-  kPostsolveError,
+  kPostsolveError,  // V2.0: Delete if not used! Add to documentation if used
   kModelEmpty,
   kOptimal,
   kInfeasible,
@@ -174,9 +196,26 @@ enum class HighsModelStatus {
   kObjectiveTarget,
   kTimeLimit,
   kIterationLimit,
+  // V2.0: put kUnknown after kSolutionLimit and kInterrupt - and then
+  // modify kMax and highs_c_api.h, highs_csharp_api.cs,
+  // highspy/highs_bindings.cpp
   kUnknown,
+  kSolutionLimit,
+  kInterrupt,
   kMin = kNotset,
-  kMax = kUnknown
+  kMax = kInterrupt
+};
+
+enum HighsCallbackType : int {
+  kCallbackMin = 0,
+  kCallbackLogging = kCallbackMin,
+  kCallbackSimplexInterrupt,
+  kCallbackIpmInterrupt,
+  kCallbackMipImprovingSolution,
+  kCallbackMipLogging,
+  kCallbackMipInterrupt,
+  kCallbackMax = kCallbackMipInterrupt,
+  kNumCallbackType
 };
 
 /** SCIP/CPLEX-like HiGHS basis status for columns and rows. */
@@ -185,7 +224,7 @@ enum class HighsBasisStatus : uint8_t {
       0,   // (slack) variable is at its lower bound [including fixed variables]
   kBasic,  // (slack) variable is basic
   kUpper,  // (slack) variable is at its upper bound
-  kZero,   // free variable is non-basic and set to zero
+  kZero,   // free variable is nonbasic and set to zero
   kNonbasic  // nonbasic with no specific bound information - useful for users
              // and postsolve
 };
@@ -232,6 +271,12 @@ const HighsInt kHighsIllegalErrorIndex = -1;
 // Maximum upper bound on semi-variables
 const double kMaxSemiVariableUpper = 1e5;
 
+// Limit on primal values being realistic
+const double kExcessivePrimalValue = 1e25;
+
+// Hash marker for duplicates
+const HighsInt kHashIsDuplicate = -1;
+
 // Tolerance values for highsDoubleToString
 const double kModelValueToStringTolerance = 1e-15;
 const double kRangingValueToStringTolerance = 1e-13;

casadi/include/highs/lp_data/HStruct.h

@@ -2,13 +2,11 @@
 /*                                                                       */
 /*    This file is part of the HiGHS linear optimization suite           */
 /*                                                                       */
-/*    Written and engineered 2008-2022 at the University of Edinburgh    */
+/*    Written and engineered 2008-2023 by Julian Hall, Ivet Galabova,    */
+/*    Leona Gottwald and Michael Feldmeier                               */
 /*                                                                       */
 /*    Available as open-source under the MIT License                     */
 /*                                                                       */
-/*    Authors: Julian Hall, Ivet Galabova, Leona Gottwald and Michael    */
-/*    Feldmeier                                                          */
-/*                                                                       */
 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
 /**@file lp_data/HStruct.h
  * @brief Structs for HiGHS
@@ -16,6 +14,7 @@
 #ifndef LP_DATA_HSTRUCT_H_
 #define LP_DATA_HSTRUCT_H_
 
+#include <unordered_map>
 #include <vector>
 
 #include "lp_data/HConst.h"
@@ -38,6 +37,12 @@ struct HighsSolution {
   void clear();
 };
 
+struct HighsObjectiveSolution {
+  double objective;
+  std::vector<double> col_value;
+  void clear();
+};
+
 struct RefactorInfo {
   bool use = false;
   std::vector<HighsInt> pivot_row;
@@ -78,14 +83,33 @@ struct HighsScale {
 };
 
 struct HighsLpMods {
-  std::vector<HighsInt> save_semi_variable_lower_bound_index;
-  std::vector<double> save_semi_variable_lower_bound_value;
-  std::vector<HighsInt> save_semi_variable_upper_bound_index;
-  std::vector<double> save_semi_variable_upper_bound_value;
+  std::vector<HighsInt> save_non_semi_variable_index;
+  std::vector<HighsInt> save_inconsistent_semi_variable_index;
+  std::vector<double> save_inconsistent_semi_variable_lower_bound_value;
+  std::vector<double> save_inconsistent_semi_variable_upper_bound_value;
+  std::vector<HighsVarType> save_inconsistent_semi_variable_type;
+
+  std::vector<HighsInt> save_relaxed_semi_variable_lower_bound_index;
+  std::vector<double> save_relaxed_semi_variable_lower_bound_value;
+  std::vector<HighsInt> save_tightened_semi_variable_upper_bound_index;
+  std::vector<double> save_tightened_semi_variable_upper_bound_value;
+
+  std::vector<HighsInt> save_inf_cost_variable_index;
+  std::vector<double> save_inf_cost_variable_cost;
+  std::vector<double> save_inf_cost_variable_lower;
+  std::vector<double> save_inf_cost_variable_upper;
+
   void clear();
   bool isClear();
 };
 
+struct HighsNameHash {
+  std::unordered_map<std::string, int> name2index;
+  void form(const std::vector<std::string>& name);
+  bool hasDuplicate(const std::vector<std::string>& name);
+  void clear();
+};
+
 struct HighsPresolveRuleLog {
   HighsInt call;
   HighsInt col_removed;

casadi/include/highs/lp_data/HighsAnalysis.h

@@ -2,13 +2,11 @@
 /*                                                                       */
 /*    This file is part of the HiGHS linear optimization suite           */
 /*                                                                       */
-/*    Written and engineered 2008-2022 at the University of Edinburgh    */
+/*    Written and engineered 2008-2023 by Julian Hall, Ivet Galabova,    */
+/*    Leona Gottwald and Michael Feldmeier                               */
 /*                                                                       */
 /*    Available as open-source under the MIT License                     */
 /*                                                                       */
-/*    Authors: Julian Hall, Ivet Galabova, Leona Gottwald and Michael    */
-/*    Feldmeier                                                          */
-/*                                                                       */
 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
 /**@file lp_data/HighsAnalysis.h
  * @brief

casadi/include/highs/lp_data/HighsCallback.h

@@ -0,0 +1,33 @@
+/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
+/*                                                                       */
+/*    This file is part of the HiGHS linear optimization suite           */
+/*                                                                       */
+/*    Written and engineered 2008-2023 by Julian Hall, Ivet Galabova,    */
+/*    Leona Gottwald and Michael Feldmeier                               */
+/*                                                                       */
+/*    Available as open-source under the MIT License                     */
+/*                                                                       */
+/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
+/**@file lp_data/HighsCallback.h
+ * @brief
+ */
+#ifndef LP_DATA_HIGHSCALLBACK_H_
+#define LP_DATA_HIGHSCALLBACK_H_
+
+#include "lp_data/HStruct.h"
+#include "lp_data/HighsCallbackStruct.h"
+
+struct HighsCallback {
+  void (*user_callback)(const int, const char*, const HighsCallbackDataOut*,
+                        HighsCallbackDataIn*, void*) = nullptr;
+  void* user_callback_data = nullptr;
+  std::vector<bool> active;
+  HighsCallbackDataOut data_out;
+  HighsCallbackDataIn data_in;
+  bool callbackActive(const int callback_type);
+  bool callbackAction(const int callback_type, std::string message = "");
+  void clearHighsCallbackDataOut();
+  void clearHighsCallbackDataIn();
+  void clear();
+};
+#endif /* LP_DATA_HIGHSCALLBACK_H_ */

casadi/include/highs/lp_data/HighsCallbackStruct.h

@@ -0,0 +1,36 @@
+/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
+/*                                                                       */
+/*    This file is part of the HiGHS linear optimization suite           */
+/*                                                                       */
+/*    Written and engineered 2008-2023 by Julian Hall, Ivet Galabova,    */
+/*    Leona Gottwald and Michael Feldmeier                               */
+/*                                                                       */
+/*    Available as open-source under the MIT License                     */
+/*                                                                       */
+/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
+/**@file lp_data/HighsCallbackStruct.h
+ * @brief
+ */
+#ifndef LP_DATA_HIGHSCALLBACKSTRUCT_H_
+#define LP_DATA_HIGHSCALLBACKSTRUCT_H_
+
+#include "util/HighsInt.h"
+
+struct HighsCallbackDataOut {
+  int log_type;  // cast of HighsLogType
+  double running_time;
+  HighsInt simplex_iteration_count;
+  HighsInt ipm_iteration_count;
+  double objective_function_value;
+  int64_t mip_node_count;
+  double mip_primal_bound;
+  double mip_dual_bound;
+  double mip_gap;
+  double* mip_solution;
+};
+
+struct HighsCallbackDataIn {
+  int user_interrupt;
+};
+
+#endif /* LP_DATA_HIGHSCALLBACKSTRUCT_H_ */

casadi/include/highs/lp_data/HighsDebug.h

@@ -2,13 +2,11 @@
 /*                                                                       */
 /*    This file is part of the HiGHS linear optimization suite           */
 /*                                                                       */
-/*    Written and engineered 2008-2022 at the University of Edinburgh    */
+/*    Written and engineered 2008-2023 by Julian Hall, Ivet Galabova,    */
+/*    Leona Gottwald and Michael Feldmeier                               */
 /*                                                                       */
 /*    Available as open-source under the MIT License                     */
 /*                                                                       */
-/*    Authors: Julian Hall, Ivet Galabova, Leona Gottwald and Michael    */
-/*    Feldmeier                                                          */
-/*                                                                       */
 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
 /**@file lp_data/HighsDebug.h
  * @brief